Online Square Packing
- 1 January 2009
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 302-314
Abstract
No abstract availableKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- TETRIS IS HARD, EVEN TO APPROXIMATEInternational Journal of Computational Geometry & Applications, 2004
- Approximate strip packing2002
- Packing rectangles in a stripActa Informatica, 2002
- On the online bin packing problemJournal of the ACM, 2002
- New classes of fast lower bounds for bin packing problemsMathematical Programming, 2001
- Computational Geometry2000
- On Two Dimensional PackingJournal of Algorithms, 1997
- Shelf algorithms for on-line strip packingInformation Processing Letters, 1997
- An improved lower bound for on-line bin packing algorithmsInformation Processing Letters, 1992
- Orthogonal Packings in Two DimensionsSIAM Journal on Computing, 1980