{\mathbb{NP}}-hard.
Marek ChrobakChristoph DürrFlavio GuiñezAntoni LozanoKim Thang NguyenPublished in: COCOON (2010)
Keyphrases
- np hard
- special case
- approximation algorithms
- scheduling problem
- greedy heuristic
- optimal solution
- remains np hard
- integer programming
- np complete
- linear programming
- computational complexity
- worst case
- closely related
- branch and bound algorithm
- np hardness
- lower bound
- knapsack problem
- minimum cost
- machine learning
- real world
- data sets
- real time
- database
- multiresolution
- decision making