# A new lower bound for classic online bin packing

arXiv: https://arxiv.org/abs/1807.05554 · HTML: https://mlsanity.com/paper/1807.05554/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 15 Jul 2018.

## Built on by (most cited first, 1 of 1)

- [Online Bin Packing with Predictions](https://mlsanity.com/paper/2102.03311/) (2021)

## Abstract (arXiv)

We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packing to above 1.54278. We demonstrate for the first time the advantage of branching and the applicability of full adaptivity in the design of lower bounds for the classic online bin packing problem. We apply a new method for weight based analysis, which is usually applied only in proofs of upper bounds. The values of previous lower bounds were approximately 1.5401 and 1.5403.