Inflating Balls is NP-Hard.
Guillaume BatogXavier GoaocPublished in: Int. J. Comput. Geom. Appl. (2011)
Keyphrases
- np hard
- optimal solution
- scheduling problem
- approximation algorithms
- special case
- lower bound
- minimum cost
- np complete
- np hardness
- closely related
- worst case
- linear programming
- high level
- remains np hard
- constraint satisfaction problems
- trade off
- three dimensional
- branch and bound algorithm
- integer programming
- artificial intelligence
- greedy heuristic
- approximation ratio
- np hard problems
- upper bound
- decision making
- computer vision
- approximate solutions
- real time
- computationally hard
- database