Tight Bounds for Online Graph Partitioning

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]

Abstract

Abstract is missing.