Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing.
Weizhen MaoPublished in: SIAM J. Comput. (1993)
Keyphrases
- bin packing
- worst case
- upper bound
- lower bound
- average case
- error bounds
- graph colouring
- search tree
- approximation algorithms
- assembly line balancing
- worst case bounds
- greedy algorithm
- packing problem
- np hard
- worst case analysis
- cutting stock
- loss bounds
- vc dimension
- constant factor
- computational complexity
- objective function