Faster Exact and Approximate Algorithms for k-Cut

07/21/2018
by   Anupam Gupta, et al.
0

In the k-cut problem, we are given an edge-weighted graph G and an integer k, and have to remove a set of edges with minimum total weight so that G has at least k connected components. The current best algorithms are an O(n^(2-o(1))k) randomized algorithm due to Karger and Stein, and an Õ(n^2k) deterministic algorithm due to Thorup. Moreover, several 2-approximation algorithms are known for the problem (due to Saran and Vazirani, Naor and Rabani, and Ravi and Sinha). It has remained an open problem to (a) improve the runtime of exact algorithms, and (b) to get better approximation algorithms. In this paper we show an O(k^O(k) n^(2ω/3 + o(1))k)-time algorithm for k-cut. Moreover, we show an (1+ϵ)-approximation algorithm that runs in time O((k/ϵ)^O(k) n^k + O(1)), and a 1.81-approximation in fixed-parameter time O(2^O(k^2) poly(n)).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2018

Fast and Deterministic Approximations for k-Cut

In an undirected graph, a k-cut is a set of edges whose removal breaks t...
research
07/19/2018

Distributed approximation algorithms for maximum matching in graphs and hypergraphs

We describe randomized and deterministic approximation algorithms in Lin...
research
11/20/2019

Exact and approximation algorithms for the expanding search problem

Suppose a target is hidden in one of the vertices of an edge-weighted gr...
research
03/26/2020

Faster Approximation Algorithms for Geometric Set Cover

We improve the running times of O(1)-approximation algorithms for the se...
research
11/19/2022

A Distanced Matching Game, Decremental APSP in Expanders, and Faster Deterministic Algorithms for Graph Cut Problems

Expander graphs play a central role in graph theory and algorithms. With...
research
06/02/2020

Stochastic Approximation Cut Algorithm for Inference in Modularized Bayesian Models

Bayesian modelling enables us to accommodate complex forms of data and m...
research
02/28/2022

Improved Combinatorial Approximation Algorithms for MAX CUT in Sparse Graphs

The Max-Cut problem is a fundamental NP-hard problem, which is attractin...

Please sign up or login with your details

Forgot password? Click here to reset