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.
Cite
CITATION STYLE
Balogh, J., Békési, J., Dósa, G., Epstein, L., & Levin, A. (2020). A New Lower Bound for Classic Online Bin Packing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11926 LNCS, pp. 18–28). Springer. https://doi.org/10.1007/978-3-030-39479-0_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
