Arrow Research search
Back to STOC

STOC 2020

The Karger-Stein algorithm is optimal for k-cut

Conference Paper Session 4A: Graph Theory and Algorithms Algorithms and Complexity ยท Theoretical Computer Science

Abstract

No abstract is available in the live database for this paper.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
383945864483980304
v2026.09.13