Approximating Good Simultaneous Diophantine Approximations Is Almost NP-Hard.
Carsten RössnerJean-Pierre SeifertPublished in: MFCS (1996)
Keyphrases
- np hard
- optimal solution
- lower bound
- approximation algorithms
- exact computation
- special case
- linear programming
- scheduling problem
- minimum cost
- computationally tractable
- integer programming
- worst case
- np complete
- np hardness
- computational complexity
- remains np hard
- closely related
- knapsack problem
- branch and bound algorithm
- upper bound
- greedy heuristic
- computationally challenging
- real time
- variational methods
- approximation methods
- constraint satisfaction problems
- computationally hard
- genetic algorithm
- databases