How to Pack Better than Best Fit: Tight Bounds for Average-Case On-Line Bin Packing
Peter W. ShorPublished in: FOCS (1991)
Keyphrases
- bin packing
- average case
- tight bounds
- upper bound
- worst case
- worst case analysis
- graph colouring
- uniform distribution
- packing problem
- vc dimension
- lower bound
- search tree
- learning curves
- average case complexity
- search space
- sample complexity
- linear programming
- nearest neighbor
- computational complexity
- database systems
- machine learning