Lower bounds for several online variants of bin packing
Data Structures and Algorithms
2017-08-11 v1 Discrete Mathematics
Combinatorics
Optimization and Control
Abstract
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.
Keywords
Cite
@article{arxiv.1708.03228,
title = {Lower bounds for several online variants of bin packing},
author = {János Balogh and József Békési and György Dósa and Leah Epstein and Asaf Levin},
journal= {arXiv preprint arXiv:1708.03228},
year = {2017}
}
Comments
WAOA 2017