Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1807.07143

Fast and Deterministic Approximations for $k$-Cut

Kent Quanrud
View original source ↗Read source document ↗Export metadata ↓

Abstract

In an undirected graph, a $k$-cut is a set of edges whose removal breaks the graph into at least $k$ connected components. The minimum weight $k$-cut can be computed in $O(n^{O(k)})$ time, but when $k$ is treated as part of the input, computing the minimum weight $k$-cut is NP-Hard [Holdschmidt and Hochbaum 1994]. For $\operatorname{poly}(m,n,k)$-time algorithms, the best possible approximation factor is essentially 2 under the small set expansion hypothesis [Manurangsi 2017]. Saran and Vazirani [1995] showed that a $(2 - 2/k)$-approximately minimum weight $k$-cut can be computed by $O(k)$ minimum cuts, which implies an $\tilde{O}(mk)$ randomized running time via the nearly linear time randomized min-cut algorithm of Karger [2000]. Nagamochi and Kamidoi [2007] showed that the minimum weight $k$-cut can be computed deterministically in $O(mn + n^2 \log n)$ time. These results prompt two basic questions. The first concerns the role of randomization. Is there a deterministic algorithm for 2-approximate $k$-cuts matching the randomized running time of $\tilde{O}(mk)$? The second question qualitatively compares minimum cut to 2-approximate minimum $k$-cut. Can 2-approximate $k$-cuts be computed as fast as the (exact) minimum cut - in $\tilde{O}(m)$ randomized time? We make progress on these questions with a deterministic approximation algorithm that computes $(2 + ε)$-minimum $k$-cuts in $O(m \log^3(n) / ε^2)$ time, via a $(1 + ε)$-approximate for an LP relaxation of $k$-cut.

Explore related subjects

cs.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kent Quanrud. 2018-11-18. Fast and Deterministic Approximations for $k$-Cut. https://arxiv.org/abs/1807.07143

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Compressed Set Representations based on Set Difference

We introduce a compressed representation of sets of sets that exploits how similar they are to each other. Our representation supports access, membership, predecessor and successor queries on the sets within logarithmic time. It also computes the support of any element (i.e., the sets containing it) in optimal time. In addition, we give a new MST-based construction algorithm for the representation that outperforms standard ones.

cs.DS↗
arXiv2026

Fast Approximation Algorithms for Balanced Edge and Vertex Separators

We present a family of fast pseudo-approximation algorithms for the minimum balanced element cut problem in a graph, which includes vertex and edge separators. Given a graph $G=(V,E)$ with polynomially-bounded finite integer element weights with $n$ vertices and $m$ edges, and a (constant) balance parameter $c\in(0,1/2)$, where $G$ has some (unknown) $c$-balanced element cut of size $OPT_c$, we give a (Monte-Carlo randomized) algorithm running in $O(n^{\varepsilon}m^{1+o(1)})$ time that produces a $Θ(1)$-balanced element cut of size $O(OPT_c\cdot\sqrt{(\log n)/\varepsilon})$ for any value $\varepsilon\in[Θ(1/\log(n)),Θ(1)]$. Our algorithms are based on a semidefinite programming (SDP) relaxation of the problem. A standard approach to solving an SDP relaxation for this kind of problem would use the primal-dual Matrix Multiplicative Weights Update framework of Arora and Kale, but this framework does not seem to apply, since we cannot express all of our SDPs primal variables explicitly. Instead, we present a new MMWU framework for our problem that allows us to represent some of our variables implicitly. We also extend our framework to a general "Partial-variable MMWU framework", which we expect will be useful for future work. Our oracle for the balanced element cut problem within our framework uses $O(n^{\varepsilon}\text{polylog}(n))$ almost-linear time maximum-flow computations, and would be sped up if the time complexity of maximum-flow improves. For graphs with padding bound $β$, another oracle gives an $O(\sqrtβ/\varepsilon)$ approximation in $m^{1+o(1)}n^{\varepsilon}\operatorname{polylog}(n)$ time. It is known that $β\le O(\log h)$ for $K_h$-minor-free graphs (and in particular $β\le O(\log n)$).

cs.DS↗
arXiv2026

Optimal-Time Move Structure Construction

The move structure represents a permutation $π$ of $[0,n)$ by partitioning the domain into $O(r)$ disjoint, contiguously permuted intervals, with $r$ being the minimum number of such intervals. This data structure occupies $O(r)$ words of space and enables $O(1)$-time computation of $π(i)$ given the interval that contains $i$. For permutations where $r \ll n$, this provides an efficient, compressed representation for navigation. While the existing best $O(r)$-space construction approaches require $O(r\log r)$-time, we present an optimal $O(r)$-time and space construction algorithm. This is achieved by replacing balanced search trees with pointer-based lists through introducing a bidirectional strategy that synchronizes construction of the structures for $π$ and its inverse $π^{-1}$ in a single, unified pass. By applying this algorithm to an existing result, we achieve the first optimal $O(n)$-time construction of the longest common prefix (LCP) array from a run-length-encoded Burrows-Wheeler transform (RLBWT) of $r$ runs in $O(r)$ working space. Empirical evaluation on pangenome-scale data confirms that our move structure construction algorithm is consistently faster than the previous best, achieving speedups of up to $\sim 2\times$ while using less memory.

cs.DS↗