The Karger-Stein algorithm is optimal for k-cut

Abstract

In the k-cut problem, we are given an edge-weighted graph and want to find the least-weight set of edges whose deletion breaks the graph into k connected components. Algorithms due to Karger-Stein and Thorup showed how to find such a minimum k-cut in time approximately O(n 2k −2). The best lower bounds come from conjectures about the solvability of the k-clique problem and a reduction from k-clique to k-cut, and show that solving k-cut is likely to require time Ω(n k). Our recent results have given specialpurpose algorithms that solve the problem in time n 1.98k +O (1) , and ones that have better performance for special classes of graphs (e.g., for small integer weights). In this work, we resolve the problem for general graphs, by showing that for any fixed k ≥ 2, the Karger-Stein algorithm outputs any fixed minimum k-cut with probability at least O(n −k), where O(•) hides a 2 O (ln ln n) 2 factor. This also gives an extremal bound of O(n k) on the number of minimum k-cuts in an n-vertex graph and an algorithm to compute a minimum k-cut in similar runtime. Both are tight up to O(1) factors. The first main ingredient in our result is a fine-grained analysis of how the graph shrinks-and how the average degree evolves-under the Karger-Stein process. The second ingredient is an extremal result bounding the number of cuts of size at most (2 − δ)OPT /k, using the Sunflower lemma. CCS CONCEPTS • Theory of computation → Graph algorithms analysis.

On Decomposition and Deployment of Virtualized Media Services

“…4. It uses the random contraction algorithm RandContr to get a k-cut of an un-directed graph G [27]. The quality of the generated k-cuts, in terms of the sum of the weights of the crossing edges, can be boosted by repeating RandContr N runs times (l. [4][5][6][7][8][9][10][11][12][13] and n bst best k-cuts are generated by running RandContr N runs times.…”

Vertex Deletion Parameterized by Elimination Distance and Even Less

“…We apply these ideas to well-studied graph problems which can be formulated in terms of vertex deletion: find a smallest vertex set whose removal ensures that the resulting graph belongs to a certain graph class. Vertex-deletion problems are among the most prominent problems studied in parameterized algorithmics [21,40,53,69,73]. We develop new algorithms for Odd cycle transversal, Vertex planarization, Chordal vertex deletion, and (induced) H-free deletion for fixed connected H, among others.…”

Optimal Bounds for the $k$-cut Problem

“…Let us contrast this proof strategy with the analysis in a preliminary version of this paper [GLL19a].…”