Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fast and Deterministic Approximations for kk-Cut

Published 18 Jul 2018 in cs.DS | (1807.07143v2)

Abstract: In an undirected graph, a kk-cut is a set of edges whose removal breaks the graph into at least kk connected components. The minimum weight kk-cut can be computed in O(nO(k))O(n^{O(k)}) time, but when kk is treated as part of the input, computing the minimum weight kk-cut is NP-Hard [Holdschmidt and Hochbaum 1994]. For poly⁡(m,n,k)\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)(2 - 2/k)-approximately minimum weight kk-cut can be computed by O(k)O(k) minimum cuts, which implies an O~(mk)\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 kk-cut can be computed deterministically in O(mn+n2log⁡n)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 kk-cuts matching the randomized running time of O~(mk)\tilde{O}(mk)? The second question qualitatively compares minimum cut to 2-approximate minimum kk-cut. Can 2-approximate kk-cuts be computed as fast as the (exact) minimum cut - in O~(m)\tilde{O}(m) randomized time? We make progress on these questions with a deterministic approximation algorithm that computes (2+ϵ)(2 + \epsilon)-minimum kk-cuts in O(mlog⁡3(n)/ϵ2)O(m \log^3(n) / \epsilon^2) time, via a (1+ϵ)(1 + \epsilon)-approximate for an LP relaxation of kk-cut.

Authors (1)
Citations (11)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.