@InProceedings{balogh_et_al:LIPIcs.APPROX/RANDOM.2021.8,
author = {Balogh, J\'{a}nos and Cohen, Ilan Reuven and Epstein, Leah and Levin, Asaf},
title = {{Truly Asymptotic Lower Bounds for Online Vector Bin Packing}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)},
pages = {8:1--8:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-207-5},
ISSN = {1868-8969},
year = {2021},
volume = {207},
editor = {Wootters, Mary and Sanit\`{a}, Laura},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.8},
URN = {urn:nbn:de:0030-drops-147013},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.8},
annote = {Keywords: Bin packing, online algorithms, approximation algorithms, vector packing}
}