Approximating CVP to Within Almost-Polynomial Factors is NP-Hard.
Irit DinurGuy KindlerRan RazShmuel SafraPublished in: Comb. (2003)
Keyphrases
- np hard
- approximation algorithms
- factors that influence
- optimal solution
- special case
- scheduling problem
- linear programming
- np complete
- factors that affect
- branch and bound algorithm
- computational complexity
- lower bound
- factors affecting
- constraint satisfaction problems
- integer programming
- greedy heuristic
- minimum cost
- information systems
- worst case
- expert systems
- databases
- closely related
- artificial neural networks
- information technology
- remains np hard