Keyphrases
- np hard
- scheduling problem
- optimal solution
- approximation algorithms
- lower bound
- np complete
- minimum cost
- euclidean distance
- special case
- worst case
- linear programming
- closely related
- np hardness
- computational complexity
- branch and bound algorithm
- euclidean space
- distance measure
- knapsack problem
- decision problems
- set cover
- approximation ratio
- real time
- remains np hard
- greedy heuristic
- integer programming
- search space
- data mining
- real world