Faster Minimum k-cut of a Simple Graph

by   Jason Li, et al.

We consider the (exact, minimum) k-cut problem: given a graph and an integer k, delete a minimum-weight set of edges so that the remaining graph has at least k connected components. This problem is a natural generalization of the global minimum cut problem, where the goal is to break the graph into k=2 pieces. Our main result is a (combinatorial) k-cut algorithm on simple graphs that runs in n^(1+o(1))k time for any constant k, improving upon the previously best n^(2ω/3+o(1))k time algorithm of Gupta et al. [FOCS'18] and the previously best n^(1.981+o(1))k time combinatorial algorithm of Gupta et al. [STOC'19]. For combinatorial algorithms, this algorithm is optimal up to o(1) factors assuming recent hardness conjectures: we show 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. This settles, up to lower-order factors, the complexity of k-cut on a simple graph for combinatorial algorithms.



There are no comments yet.


page 1

page 2

page 3

page 4


Optimal Bounds for the k-cut Problem

In the k-cut problem, we want to find the smallest set of edges whose de...

Breaking the n^k Barrier for Minimum k-cut on Simple Graphs

In the minimum k-cut problem, we want to find the minimum number of edge...

Faster Parallel Multiterminal Cuts

We give an improved branch-and-bound solver for the multiterminal cut pr...

Graph-Cut RANSAC

A novel method for robust estimation, called Graph-Cut RANSAC, GC-RANSAC...

An FFT-based method for computing the effective crack energy of a heterogeneous material on a combinatorially consistent grid

We introduce an FFT-based solver for the combinatorial continuous maximu...

Faster Algorithms for All-Pairs Bounded Min-Cuts

Given a directed graph, the vertex connectivity from u to v is the maxim...

Improving the Integrality Gap for Multiway Cut

In the multiway cut problem, we are given an undirected graph with non-n...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.