A lower bound for online rectangle packing

Research output: Contribution to journalArticlepeer-review


We slightly improve the known lower bound on the asymptotic competitive ratio for online bin packing of rectangles. We present a complete proof for the new lower bound, whose value is above 1.91.

Original languageEnglish
Pages (from-to)846-866
Number of pages21
JournalJournal of Combinatorial Optimization
Issue number3
StatePublished - 15 Oct 2019

Bibliographical note

Publisher Copyright:
© 2019, Springer Science+Business Media, LLC, part of Springer Nature.


  • Competitive ratio
  • Online algorithms
  • Rectangle packing

ASJC Scopus subject areas

  • Computer Science Applications
  • Discrete Mathematics and Combinatorics
  • Control and Optimization
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'A lower bound for online rectangle packing'. Together they form a unique fingerprint.

Cite this