Skip to main content
SpringerLink
Log in
Book cover

Scandinavian Workshop on Algorithm Theory

SWAT 1996: Algorithm Theory — SWAT'96 pp 321–332Cite as

On two dimensional packing

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1097))

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 1/ɛ), where ɛ is the minimum width of any rectangle. We also show that no algorithm can achieve a better ratio than Ω(√log 1/ɛ) for this case.

This work was submitted as part of the M.Sc. thesis of the second author.

Research supported in part by Allon Fellowship and by the Israel Science Foundation administered by the Israel Academy of Sciences.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B.S. Baker, E.G. Coffman, Jr, and R.L. Rivest. Orthogonal packings in two dimensions. In The SIAM Journal of Computing, pages 846–855, 1980.

    Google Scholar 

  2. Y. Bartal, A. Fiat, H. Karloff, and R. Vohra. New algorithms for an ancient scheduling problem. In Proc. 24th ACM Symp. on Theory of Computing, pages 51–58, 1992.

    Google Scholar 

  3. Y. Bartal, H. Karloff, Y. Rabani. A better lower bound for on-line scheduling. In Information Processing Letters 50 pages 113–116, 1994.

    Google Scholar 

  4. B. Chen, and A. van Vliet. On the on-line scheduling algorithm RLS Report 9325/A, Econometric Institute, Erasmus University, Rotterdam. 1993.

    Google Scholar 

  5. B. Chen, A. van Vliet, and G.J. Woeginger. New lower and upper bounds for on-line scheduling. In Operations Research Letters, pages 222–230, 1994.

    Google Scholar 

  6. J. Csirik, J.B.G. Frenk, and M. Labbe. Two-dimensional rectangle packing: on-line methods and results. In Discrete applied Mathematics 45, pages 197–204, 1993.

    Google Scholar 

  7. E.G. Coffman, Jr, M.R. Garey, D.S. Johnson, and R.E. Tarjan. Performance bounds for level oriented two-dimensional packing Algorithms. In The SIAM Journal of Computing, pages 808–826, 1980.

    Google Scholar 

  8. D. Coppersmith, and P. Raghavan. Multidimensional on-line bin packing: algorithms and worst-case analysis. In Operation Research Letters, pages 17–20, 1989.

    Google Scholar 

  9. G. Galambos. A 1.6 lower bound for the two-dimensional on-line rectangle bin packing In Acta Cybernetica, pages 21–24, 1991.

    Google Scholar 

  10. G. Galambos, A. van Vliet. Lower bounds for 1-,2-and 3-dimensional on-line bin packing algorithms. In Computing, pages 281–297, 1994.

    Google Scholar 

  11. G. Galambos, and G.J. Woeginger. An on-line scheduling heuristic with better worst case than Graham's list scheduling. In SIAM J. Comput. 22, pages 349–355, 1993.

    Google Scholar 

  12. R.L. Graham. Bounds for certain multiprocessing anomalies. In Bell System Tech J. 45, pages 1563–1581, 1966.

    Google Scholar 

  13. D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms. In The SIAM Journal of Computing, pages 299–325, 1974.

    Google Scholar 

  14. H. Karloff. Personal communication.

    Google Scholar 

  15. D.R. Karger, S.J. Phillips, and E. Torng. A better algorithm for an ancient scheduling problem. In Proc. 5 Ann. ACM-SIAM symposium on Discrete Algorithms, pages 132–140, 1994.

    Google Scholar 

  16. F. M. Liang. A lower bound for on-line bin packing. In Information Processing letters, pages 76–79, 1980.

    Google Scholar 

  17. A. van Vliet. Lower and upper bounds for on-line bin packing and scheduling heuristics. Ph.D. thesis. Thesis publishers, Amsterdam, 1995.

    Google Scholar 

  18. A.C. Yao. New algorithms for bin packing. In Journal of the ACM, pages 207–227, 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Tel-Aviv University, USA

    Yossi Azar

  2. Dept. of Computer Science, Tel-Aviv University, USA

    Leah Epstein

Authors
  1. Yossi Azar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leah Epstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rolf Karlsson Andrzej Lingas

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Azar, Y., Epstein, L. (1996). On two dimensional packing. In: Karlsson, R., Lingas, A. (eds) Algorithm Theory — SWAT'96. SWAT 1996. Lecture Notes in Computer Science, vol 1097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61422-2_142

Download citation

  • DOI: https://doi.org/10.1007/3-540-61422-2_142

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61422-7

  • Online ISBN: 978-3-540-68529-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation