Approximating CVP to Within Almost Polynomial Factor is NP-Hard
Irit DinurGuy KindlerShmuel SafraPublished in: Electron. Colloquium Comput. Complex. (1998)
Keyphrases
- np hard
- optimal solution
- worst case
- scheduling problem
- special case
- approximation algorithms
- lower bound
- linear programming
- factor analysis
- greedy heuristic
- computational complexity
- np complete
- closely related
- fixed parameter tractable
- integer programming
- minimum cost
- constraint satisfaction problems
- computationally hard
- np hardness
- neural network
- remains np hard
- uniform distribution
- knapsack problem
- decision problems
- clustering algorithm
- computer vision