On two dimensional Packing

Yossi Azar, Leah Epstein

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationAlgorithm Theory - SWAT 1996 - 5th Scandinavian Workshop on Algorithm Theory, Proceedings
EditorsRolf Karlsson, Andrzej Lingas
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540614222, 9783540614227
StatePublished - 1996
Externally publishedYes
Event5th Scandinavian Workshop on Algorithm Theory, SWAT 1996 - Reykjavik, Iceland
Duration: 3 Jul 19965 Jul 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th Scandinavian Workshop on Algorithm Theory, SWAT 1996

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1996.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'On two dimensional Packing'. Together they form a unique fingerprint.

Cite this