External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Monika Henzinger

This author has not been identified. Look up 'Monika Henzinger' in Google

Stefan Neumann 0003

This author has not been identified. Look up 'Stefan Neumann 0003' in Google

Harald Räcke

This author has not been identified. Look up 'Harald Räcke' in Google

Stefan Schmid 0001

This author has not been identified. Look up 'Stefan Schmid 0001' in Google
runs on