@InProceedings{momke_et_al:LIPIcs.ICALP.2020.86,
author = {M\"{o}mke, Tobias and Wiese, Andreas},
title = {{Breaking the Barrier of 2 for the Storage Allocation Problem}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {86:1--86:19},
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.86},
URN = {urn:nbn:de:0030-drops-124931},
doi = {10.4230/LIPIcs.ICALP.2020.86},
annote = {Keywords: Approximation Algorithms, Resource Allocation, Dynamic Programming}
}