Tight Bounds for Online Graph Partitioning

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Henzinger, Monika; Neumann, Stefan; R��cke, Harald; Schmid, Stefan

Journal title: ACM-SIAM Symposium on Discrete Algorithms (SODA)

Journal publisher: ACM

Published year: 2021

DOI identifier: 10.48550/arxiv.2011.01017