Monika Henzinger, Stefan Neumann 0003, Harald Räcke, Stefan Schmid 0001. Tight Bounds for Online Graph Partitioning. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 2799-2818, SIAM, 2022. [doi]
@inproceedings{Henzinger0R022,
title = {Tight Bounds for Online Graph Partitioning},
author = {Monika Henzinger and Stefan Neumann 0003 and Harald Räcke and Stefan Schmid 0001},
year = {2022},
doi = {10.1137/1.9781611976465.166},
url = {https://doi.org/10.1137/1.9781611976465.166},
researchr = {https://researchr.org/publication/Henzinger0R022},
cites = {0},
citedby = {0},
pages = {2799-2818},
booktitle = {Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022},
editor = {Joseph (Seffi) Naor and Niv Buchbinder},
publisher = {SIAM},
isbn = {978-1-61197-707-3},
}