Lower Bounds for Several Online Variants of Bin Packing

János Balogh, József Békési, G. Dósa, Leah Epstein, Asaf Levin

Research output: Contribution to journalArticle

1 Citation (Scopus)


We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75.

Original languageEnglish
JournalTheory of Computing Systems
Publication statusPublished - Jan 1 2019


  • Bin packing
  • Competitive ratio
  • Lower bounds
  • Online algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Lower Bounds for Several Online Variants of Bin Packing'. Together they form a unique fingerprint.

  • Cite this