@inproceedings{34225f9d079f45968123ce333338eda7,
title = "A New Lower Bound for Classic Online Bin Packing",
abstract = "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.",
author = "J{\'a}nos Balogh and J{\'o}zsef B{\'e}k{\'e}si and Gy{\"o}rgy D{\'o}sa and Leah Epstein and Asaf Levin",
note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG.; 17th International Workshop on Approximation and Online Algorithms, WAOA 2019 ; Conference date: 12-09-2019 Through 13-09-2019",
year = "2020",
doi = "10.1007/978-3-030-39479-0_2",
language = "American English",
isbn = "9783030394783",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "18--28",
editor = "Evripidis Bampis and Nicole Megow",
booktitle = "Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Revised Selected Papers",
address = "Netherlands",
}