@InProceedings{ezra_et_al:LIPIcs.APPROX/RANDOM.2024.12,
author = {Ezra, Tomer and Leonardi, Stefano and Paw{\l}owski, Micha{\l} and Russo, Matteo and Umboh, Seeun William},
title = {{Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)},
pages = {12:1--12:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-348-5},
ISSN = {1868-8969},
year = {2024},
volume = {317},
editor = {Kumar, Amit and Ron-Zewi, Noga},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.12},
URN = {urn:nbn:de:0030-drops-210050},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2024.12},
annote = {Keywords: Set Cover, Joint Replenishment, TCP-Acknowledgment, Subadditive Function Approximation, Multi-Level Aggregation}
}