Skip to main content
SpringerLink
Log in

A (5/3 + ε)-Approximation for Strip Packing

  • Conference paper
Algorithms and Data Structures (WADS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6844))

Included in the following conference series:

Abstract

We study strip packing, which is one of the most classical two-dimensional packing problems: Given a collection of rectangles, the problem is to find a feasible orthogonal packing without rotations into a strip of width 1 and minimum height. In this paper we present an approximation algorithm for the strip packing problem with approximation ratio of 5/3 + ε for any ε > 0. This result significantly narrows the gap between the best known upper bounds of 2 by Schiermeyer and Steinberg and 1.9396 by Harren and van Stee and the lower bound of 3/2.

Research supported by German Research Foundation (DFG) project JA612/12-1, “Design and analysis of approximation algorithms for two- and three-dimensional packing problems” and project STE 1727/3-2, “Approximation and online algorithms for game theory”.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baker, B.S., Brown, D.J., Katseff, H.P.: A 5/4 algorithm for two-dimensional packing. Journal of Algorithms 2(4), 348–368 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  2. Baker, B.S., Coffman Jr., E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM Journal on Computing 9(4), 846–855 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bansal, N., Caprara, A., Jansen, K., Prädel, L., Sviridenko, M.: A structural lemma in 2-dimensional packing, and its implications on approximability. In: ISAAC: Proc. 20th International Symposium on Algorithms and Computation, pp. 77–86 (2009)

    Google Scholar 

  4. Bansal, N., Caprara, A., Sviridenko, M.: A new approximation method for set covering problems, with applications to multidimensional bin packing. SIAM Journal on Computing 39(4), 1256–1278 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bansal, N., Correa, J.R., Kenyon, C., Sviridenko, M.: Bin packing in multiple dimensions: Inapproximability results and approximation schemes. Mathematics on Operation Research 31(1), 31–49 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Coffman Jr., E.G., Garey, M.R., Johnson, D.S., Tarjan, R.E.: Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing 9(4), 808–826 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  7. Golan, I.: Performance bounds for orthogonal oriented two-dimensional packing algorithms. SIAM Journal on Computing 10(3), 571–582 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  8. Harren, R., Jansen, K., Prädel, L., van Stee, R.: A (5/3 + ε)-approximation for strip packing. Technical Report 1105. University of Kiel (2011), http://www.informatik.uni-kiel.de/en/ifi/research/technical-reports/

  9. Harren, R., van Stee, R.: Improved absolute approximation ratios for two-dimensional packing problems. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009 and RANDOM 2009. LNCS, vol. 5687, pp. 177–189. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Jansen, K., Prädel, L., Schwarz, U.M.: Two for one: Tight approximation of 2d bin packing. In: WADS: Proc. Workshop on Algorithms and Data Structures, pp. 399–410 (2009)

    Google Scholar 

  11. Jansen, K., Solis-Oba, R.: Rectangle packing with one-dimensional resource augmentation. Discrete Optimization 6(3), 310–323 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Jansen, K., Thöle, R.: Approximation algorithms for scheduling parallel jobs: Breaking the approximation ratio of 2. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 234–245. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Jansen, K., Zhang, G.: Maximizing the total profit of rectangles packed into a rectangle. Algorithmica 47(3), 323–342 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kenyon, C., Rémila, E.: A near optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research 25(4), 645–656 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  15. Schiermeyer, I.: Reverse-fit: A 2-optimal algorithm for packing rectangles. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 290–299. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  16. Sleator, D.D.: A 2.5 times optimal algorithm for packing in two dimensions. Information Processing Letters 10(1), 37–40 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  17. Steinberg, A.: A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing 26(2), 401–409 (1997)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik (MPII), Campus E1 4, 66123, Saarbrücken, Germany

    Rolf Harren & Rob van Stee

  2. Institut für Informatik, Universität Kiel, Christian-Albrechts-Platz 4, 24118, Kiel, Germany

    Klaus Jansen & Lars Prädel

Authors
  1. Rolf Harren
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Klaus Jansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lars Prädel
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rob van Stee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Parallel Computing and Bioinformatics Laboratory, Carleton University, VISM Building, Room 6210, 1125 Colonel By Drive, K1S 5B6, Ottawa, ON, Canada

    Frank Dehne

  2. Department of Computer Science and Engineering, Polytechnic Institute of New York University, 5 MetroTech Center, 11201, New York, NY, USA

    John Iacono

  3. School of Computer Science, Herzberg Laboratories, Carleton University, Herzberg Building, Room 5350, 1125 Colonel By Drive, K1S 5B6, Ottawa, ON, Canada

    Jörg-Rüdiger Sack

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harren, R., Jansen, K., Prädel, L., van Stee, R. (2011). A (5/3 + ε)-Approximation for Strip Packing. In: Dehne, F., Iacono, J., Sack, JR. (eds) Algorithms and Data Structures. WADS 2011. Lecture Notes in Computer Science, vol 6844. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22300-6_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22300-6_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22299-3

  • Online ISBN: 978-3-642-22300-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation