@InProceedings{bienkowski_et_al:LIPIcs.ICALP.2020.13,
author = {Bienkowski, Marcin and Pacut, Maciej and Piecuch, Krzysztof},
title = {{An Optimal Algorithm for Online Multiple Knapsack}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {13:1--13:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.13},
URN = {urn:nbn:de:0030-drops-124207},
doi = {10.4230/LIPIcs.ICALP.2020.13},
annote = {Keywords: online knapsack, multiple knapsacks, bin packing, competitive analysis}
}