Keyphrases
- np hard
- scheduling problem
- special case
- np complete
- approximation algorithms
- remains np hard
- optimal solution
- lower bound
- np hardness
- greedy heuristic
- linear programming
- integer programming
- computational complexity
- constraint satisfaction problems
- branch and bound algorithm
- closely related
- worst case
- real time
- machine learning
- knapsack problem
- minimum cost
- greedy algorithm
- relational databases
- computationally challenging