@inproceedings{a044f6dba04f4103b2efb6e74ac687e9,

title = "On two dimensional Packing",

abstract = "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.",

author = "Yossi Azar and Leah Epstein",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1996.; null ; Conference date: 03-07-1996 Through 05-07-1996",

year = "1996",

doi = "10.1007/3-540-61422-2_142",

language = "אנגלית",

isbn = "3540614222",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "321--332",

editor = "Rolf Karlsson and Andrzej Lingas",

booktitle = "Algorithm Theory - SWAT 1996 - 5th Scandinavian Workshop on Algorithm Theory, Proceedings",

}