Optimal Bounds for the k-cut Problem

  title={Optimal Bounds for the k-cut Problem},
  author={Anupam Gupta and David G. Harris and Euiwoong Lee and Jason Li},
  journal={ACM Journal of the ACM (JACM)},
  pages={1 - 18}
In the k-cut problem, we want to find the lowest-weight set of edges whose deletion breaks a given (multi)graph into k connected components. Algorithms of Karger and Stein can solve this in roughly O(n2k) time. However, lower bounds from conjectures about the k-clique problem imply that Ω (n(1-o(1))k) time is likely needed. Recent results of Gupta, Lee, and Li have given new algorithms for general k-cut in n1.98k + O(1) time, as well as specialized algorithms with better performance for certain… 

Figures from this paper

Fixed Parameter Approximation Scheme for Min-max k-cut

The study of Minmax $k-cut is initiated by showing that it is NP-hard and W[1]-hard when parameterized by $k, and a parameterized approximation scheme when parameterization by $ k is designed.

On the Hardness of Approximating the k-Way Hypergraph Cut problem

The reduction combined with the hardness result of (Manurangsi, STOC’17) implies that under the Exponential Time Hypothesis (ETH), there is no n1/(log logn) c -approximation for k-WAY HYPERGRAPH CUT where c > 0 is a universal constant and n is the number of nodes.

Algorithms: New Techniques for Old Problems

This thesis focuses on this modern approach to algorithm design—drawing techniques from multidisciplinary fields—with the goal of resolving long-standing open problems that have resisted individual approaches in the past, and demonstrates the power of unifying algorithmic techniques as a whole.

Counting and enumerating optimum cut sets for hypergraph k-partitioning problems for fixed k

We consider the problem of enumerating optimal solutions for two hypergraph k -partitioning problems – namely, Hypergraph- k -Cut and Minmax-Hypergraph- k -Partition . The input in hypergraph k

Breaking the nk barrier for minimum k-cut on simple graphs

This work designs an algorithm that runs in time O(n(1−є)k+O(1)) where є>0 is an absolute constant, breaking the natural nk barrier and establishing a separation of the two problems in the unweighted and weighted cases.

Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k

This work gives the first deterministic polynomial-time algorithm to solve Enum-Hypergraph-k-Cut, which is based on new structural results that allow for efficient recovery of all minimum k-cut-sets by solving minimum (S, T )-terminal cuts.

Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time

This work develops the first deterministic polynomial time algorithm for Hypergraph-<tex>$k$</tex>-Cut for all fixed graphs and describes two algorithms both of which are based on a divide and conquer approach.



The Karger-Stein algorithm is optimal for k-cut

The problem for general graphs is resolved, 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(lnlnn)2 factor.

A Deterministic Algorithm for Finding All Minimum k-Way Cuts

The algorithm is a divide-and-conquer method based on a procedure that reduces an instance of the minimum $k$-way cut problem to $O(n^{2k-5})$ instances of theminimum $(\lfloor (k+\sqrt{k})/2\rfloor+1)$- way cut problem, and can be implemented to run in time.

Faster Minimum k-cut of a Simple Graph

  • Jason Li
  • Mathematics, Computer Science
    2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2019
It is shown by a straightforward reduction that k-CUT on even a simple graph is as hard as (k-1) -clique, establishing a lower bound of n^ (1-o(1))k for k- CUT, which settles, up to lower-order factors, the complexity of k- cUT on a simplegraph for combinatorial algorithms.

The number of minimum k-cuts: improving the Karger-Stein bound

An algorithm is given to enumerate all minimum k-cuts in O(n(1.981+o(1))k) time, breaking the algorithmic and extremal barriers for enumeratingMinimum k-cut.

LP Relaxation and Tree Packing for Minimum k-cuts

It is shown that the dual of the LP yields a tree packing, that when combined with an upper bound on the integrality gap for the LP, easily and transparently extends Karger's analysis for mincut to the $k-cut problem.

Faster Exact and Approximate Algorithms for k-Cut

An O(k^O(k) n^(2Ω/3 + o(1))k)-time algorithm for k-cut and a 1.81-approximation in fixed-parameter time O(2^O (k^2) poly(n)).

Minimum k-way cuts via deterministic greedy tree packing

A simple and fast deterministic algorithm for the minimum k-way cut problem in a capacitated graph, that is, finding a set of edges with minimum total capacity whose removal splits the graph into at least k components, which essentially match the O(n(2-o(1))k) running time of the Monto Carlo (no correctness guarantee) randomized algorithm of Karger and Stein.

A Polynomial Algorithm for the k-cut Problem for Fixed k

A polynomial algorithm for k fixed, that runs in Onki¾²/2-3k/2+4Tn, m steps, where Tn,m is the running time required to find the minimum s, t-cut on a graph with n vertices and m edges.

A new approach to the minimum cut problem

A randomized, strongly polynomial algorithm that finds the minimum cut in an arbitrarily weighted undirected graph with high probability with a significant improvement over the previous time bounds based on maximum flows.

Global min-cuts in RNC, and other ramifications of a simple min-out algorithm

This algorithm provides the first proof that the min-cut problem for weighted undirected graphs is in 7ZAfC, and does more than find a single mm-cut; it finds all of them.