The Sorting Buffer Problem is NP-hard
Ho-Leung ChanNicole MegowRob van SteeRené SittersPublished in: CoRR (2010)
Keyphrases
- np hard
- approximation algorithms
- scheduling problem
- np hardness
- special case
- np complete
- optimal solution
- lower bound
- branch and bound algorithm
- integer programming
- worst case
- buffer size
- decision problems
- knapsack problem
- linear programming
- information systems
- data sets
- minimum cost
- computationally challenging
- remains np hard
- closely related
- relational databases
- expert systems
- decision trees
- learning algorithm
- machine learning