The paper considers packing of rectangles into an infinite bin. Similar to the Tetris game, the rectangles arrive from the top and, once placed, cannot be moved again. The rectangles are moved inside the bin to reach their place. For the case in which rotations are allowed, we design an algorithm whose performance ratio is constant. In contrast, if rotations are not allowed, we show that no algorithm of constant ratio exists. For this case we design an algorithm with performance ratio of O(log [Formula presented]), where ϵ s the minimum width of any rectangle. We also show that no algorithm can achieve a better ratio than /2[Formula presented]) for this cane.
|Title of host publication||Algorithm Theory - SWAT 1996 - 5th Scandinavian Workshop on Algorithm Theory, Proceedings|
|Editors||Rolf Karlsson, Andrzej Lingas|
|Number of pages||12|
|ISBN (Print)||3540614222, 9783540614227|
|State||Published - 1996|
|Event||5th Scandinavian Workshop on Algorithm Theory, SWAT 1996 - Reykjavik, Iceland|
Duration: 3 Jul 1996 → 5 Jul 1996
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||5th Scandinavian Workshop on Algorithm Theory, SWAT 1996|
|Period||3/07/96 → 5/07/96|
Bibliographical noteFunding Information:
* This work was submitted as part of the M.Sc. thesis of the second author. An extended abstract of this paper appeared in ``Proc. of SWAT '96, 5th Scandinavian Workshop on Algorithm Theory. Reykjavik, Iceland, July 1996,'' pp. 321—332. ²E-mail: email@example.com. Research supported in part by Allon Fellowship and by the Israel Science Foundation administered by the Israel Academy of Sciences. ³E-mail: firstname.lastname@example.org.
© Springer-Verlag Berlin Heidelberg 1996.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)