A bin packing algorithm with complexity O(n log n) and performance 1 in the stochastic limit
- 1 January 1981
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Probabilistic analysis for simple one-and two-dimensional bin packing algorithmsInformation Processing Letters, 1980
- Two-dimensional packing: expected performance of simple level algorithmsInformation and Control, 1980
- New Algorithms for Bin PackingJournal of the ACM, 1980
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974