Document Open Access Logo

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm

Authors Stefan Hougardy , Bart Zondervan

PDF

File

Thumbnail PDF
PDF
LIPIcs.STACS.2026.54.pdf
  • Filesize: 1.15 MB
  • 17 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Packing and covering problems
Keywords
  • Approximation Algorithm
  • Strip Packing
  • Bottom-Left Algorithm
  • Rectangle Packing

Metrics

Abstract

In the Strip Packing problem, we are given a vertical strip of fixed width and unbounded height, along with a set of axis‑parallel rectangles. The task is to place all rectangles within the strip, without overlaps, while minimizing the height of the packing. This problem is known to be NP-hard. The Bottom-Left Algorithm is a simple and widely used heuristic for Strip Packing. Given a fixed order of the rectangles, it places them one by one, always choosing the lowest feasible position in the strip and, in case of ties, the leftmost one. Baker, Coffman, and Rivest proved in 1980 that the Bottom-Left Algorithm has approximation ratio 3 if the rectangles are sorted by decreasing width [Brenda S. Baker et al., 1980]. For the past 45 years, no alternative ordering has been found that improves this bound. We introduce a new rectangle ordering and show that with this ordering the Bottom-Left Algorithm achieves a 13/6 approximation for the Strip Packing problem.

Cite As Get BibTex

Stefan Hougardy and Bart Zondervan. A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm. In 43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 364, pp. 54:1-54:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.STACS.2026.54

Author Details

Stefan Hougardy
  • Research Institute for Discrete Mathematics, University of Bonn, Germany
  • Hausdorff Center for Mathematics, University of Bonn, Germany
Bart Zondervan
  • Faculty of Mathematics and Computer Science, University of Bremen, Germany

Funding

  • Hougardy, Stefan: funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy - EXC-2047/1 - 390685813.

References

  1. Brenda S. Baker, Edward G. Coffman Jr., and Ronald L. Rivest. Orthogonal packings in two dimensions. SIAM J. Comput., 9(4):846-855, 1980. URL: https://doi.org/10.1137/0209064.
  2. Allan Borodin, Morten N. Nielsen, and Charles Rackoff. (Incremental) priority algorithms. Algorithmica, 37(4):295-326, 2003. URL: https://doi.org/10.1007/S00453-003-1036-3.
  3. Donna J. Brown. An improved BL lower bound. Information Processing Letters, 11(1):37-39, 1980. URL: https://doi.org/10.1016/0020-0190(80)90031-9.
  4. Bernard Chazelle. The bottom-left bin-packing heuristic: An efficient implementation. IEEE Transactions on Computers, C-32(8):697-707, 1983. URL: https://doi.org/10.1109/TC.1983.1676307.
  5. E. G. Coffman, Jr., M. R. Garey, D. S. Johnson, and R. E. Tarjan. Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9(4):808-826, 1980. URL: https://doi.org/10.1137/0209062.
  6. Jie Fang, Xubing Chen, Yunqing Rao, Yili Peng, and kuan Yan. A new approach for bin packing problem using knowledge reuse and improved heuristic. Scientific Reports, 14(1):31708, 2024. URL: https://doi.org/10.1038/s41598-024-81749-5.
  7. Sándor P. Fekete, Tom Kamphans, and Nils Schweer. Online square packing with gravity. Algorithmica, 68(4):1019-1044, 2014. URL: https://doi.org/10.1007/s00453-012-9713-8.
  8. Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, and Malin Rau. A tight (3/2+ε)-approximation for skewed strip packing. Algorithmica, 85(10):3088-3109, 2023. URL: https://doi.org/10.1007/s00453-023-01130-2.
  9. M. R. Garey and D. S. Johnson. "Strong" NP-completeness results: motivation, examples, and implications. Journal of the Association for Computing Machinery, 25(3):499-508, 1978. URL: https://doi.org/10.1145/322077.322090.
  10. Rolf Harren, Klaus Jansen, Lars Prädel, and Rob van Stee. A (5/3+ε)-approximation for strip packing. Computational Geometry, 47(2):248-267, 2014. URL: https://doi.org/10.1016/j.comgeo.2013.08.008.
  11. Rolf Harren and Rob van Stee. Improved absolute approximation ratios for two-dimensional packing problems. In Irit Dinur, Klaus Jansen, Joseph Naor, and José Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Proceedings of the 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, LNCS 5687, pages 177-189, 2009. URL: https://doi.org/10.1007/978-3-642-03685-9_14.
  12. Stefan Hougardy and Bart Zondervan. The bottom-left algorithm for the strip packing problem. In Adele Anna Rescigno and Ugo Vaccaro, editors, Combinatorial Algorithms. 35th International Workshop, IWOCA 2024, LNCS 14764, pages 433-445, 2024. URL: https://doi.org/10.1007/978-3-031-63021-7_33.
  13. Stefan Jakobs. On genetic algorithms for the packing of polygons. European Journal of Operational Research, 88(1):165-181, 1996. URL: https://doi.org/10.1016/0377-2217(94)00166-9.
  14. Klaus Jansen and Roberto Solis-Oba. Rectangle packing with one-dimensional resource augmentation. Discrete Optimization, 6:310-323, 2009. URL: https://doi.org/10.1016/j.disopt.2009.04.001.
  15. Richard M. Karp. Reducibility among combinatorial problems. In Raymond E. Miller and James W. Thatcher, editors, Complexity of Computer Computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972), pages 85-103. Plenum Press, New York-London, 1972. URL: https://doi.org/10.1007/978-1-4684-2001-2_9.
  16. Claire Kenyon and Eric Rémila. A near-optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research, 25(4):645-656, 2000. URL: https://doi.org/10.1287/moor.25.4.645.12118.
  17. Stefan Michel. Revisiting Chazelle’s implementation of the Bottom-Left heuristic: A corrected and rigorous analysis, 2025. URL: https://doi.org/10.48550/arXiv.2511.07008.
  18. T. Rolich, D. Domović, and M. Golub. Bottom-left and sequence pair for solving packing problems. In 39th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), pages 1318-1323, 2016. URL: https://doi.org/10.1109/MIPRO.2016.7522344.
  19. Ingo Schiermeyer. Reverse-fit: A 2-optimal algorithm for packing rectangles. In Second Annual European Symposium on Algorithms (ESA '94), LNCS 855, pages 290-299, 1994. URL: https://doi.org/10.1007/BFb0049416.
  20. Daniel D. K. D. B. Sleator. A 2.5 times optimal algorithm for packing in two dimensions. Information Processing Letters, 10(1):37-40, 1980. URL: https://doi.org/10.1016/0020-0190(80)90121-0.
  21. A Steinberg. A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing, 26(2):401-409, 1997. URL: https://doi.org/10.1137/S0097539793255801.
  22. Maxim Sviridenko. A note on the Kenyon–Remila strip-packing algorithm. Information Processing Letters, 112:10-12, 2012. URL: https://doi.org/10.1016/j.ipl.2011.10.003.
  23. S. N. Zhuk. Approximate algorithms to pack rectangles into several strips. Discrete Mathematics and Applications, 16(1):73-85, 2006. URL: https://doi.org/10.1515/156939206776241264.
  24. Bart Zondervan. The Bottom-Left algorithm for the strip packing problem. Master’s thesis, Research Institute for Discrete Mathematics, University of Bonn, 2023. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact