On-line packing and covering problems
- 1 January 1998
- book chapter
- other
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 147-177
- https://doi.org/10.1007/bfb0029568
Abstract
No abstract availableKeywords
This publication has 79 references indexed in Scilit:
- Shelf algorithms for on-line strip packingInformation Processing Letters, 1997
- A fundamental restriction on fully dynamic maintenance of bin packingInformation Processing Letters, 1996
- Packings in two dimensions: Asymptotic average-case analysis of algorithmsAlgorithmica, 1993
- Average-case analysis of the Smart Next Fit algorithmInformation Processing Letters, 1989
- Online algorithms for a dual version of bin packingDiscrete Applied Mathematics, 1988
- A probabilistic analysis of the Next-Fit bin packing algorithmJournal of Algorithms, 1984
- On a dual version of the one-dimensional bin packing problemJournal of Algorithms, 1984
- A lower bound for on-line bin packingInformation Processing Letters, 1980
- A 2.5 times optimal algorithm for packing in two dimensionsInformation Processing Letters, 1980
- Fast algorithms for bin packingJournal of Computer and System Sciences, 1974