Keyphrases
- np hard
- np complete
- scheduling problem
- special case
- optimal solution
- linear programming
- three dimensional
- multiresolution
- lower bound
- np hardness
- approximation algorithms
- closely related
- minimum cost
- greedy heuristic
- remains np hard
- branch and bound algorithm
- terrain modeling
- integer programming
- computational complexity
- multi agent
- decision problems
- worst case
- rough terrain
- knapsack problem
- expert systems
- search algorithm
- set cover
- computationally challenging
- polynomial time approximation
- e learning
- real world