Keyphrases
- np hard
- knapsack problem
- optimal solution
- greedy heuristic
- dynamic programming
- lower bound
- upper bound
- linear programming
- scheduling problem
- special case
- approximation algorithms
- branch and bound algorithm
- np complete
- np hardness
- constraint satisfaction problems
- packing problem
- greedy algorithm
- feasible solution
- closely related
- decision trees
- worst case
- computational complexity
- cryptographic protocols
- computationally hard
- randomly generated problem instances