Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard.
Irit DinurGuy KindlerShmuel SafraPublished in: FOCS (1998)
Keyphrases
- np hard
- approximation algorithms
- lower bound
- factors that influence
- scheduling problem
- closely related
- np hardness
- greedy heuristic
- optimal solution
- remains np hard
- factors that affect
- factors influencing
- np complete
- factors affecting
- decision problems
- database
- linear programming
- special case
- knapsack problem
- empirical data
- evolutionary algorithm
- key factors
- artificial neural networks
- multi agent
- knowledge base
- information systems
- real world