Approximating the SVP to within a Factor is NP-Hard under Randomized Reductions.
Jin-yi CaiAjay NerurkarPublished in: Computational Complexity Conference (1998)
Keyphrases
- np hard
- approximation algorithms
- optimal solution
- np complete
- lower bound
- scheduling problem
- special case
- linear programming
- np hardness
- worst case
- computational complexity
- computationally challenging
- decision forest
- greedy heuristic
- closely related
- real time
- decision problems
- branch and bound algorithm
- multiple views
- constraint satisfaction problems
- d objects