CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Optimal Bounds for the
k
k
k
-cut Problem
Authors
Anupam Gupta
David G. Harris
Euiwoong Lee
Jason Li
Publication date
12 February 2021
Publisher
View
on
arXiv
Abstract
In the
k
k
k
-cut problem, we want to find the smallest set of edges whose deletion breaks a given (multi)graph into
k
k
k
connected components. Algorithms of Karger & Stein and Thorup showed how to find such a minimum
k
k
k
-cut in time approximately
O
(
n
2
k
)
O(n^{2k})
O
(
n
2
k
)
. The best lower bounds come from conjectures about the solvability of the
k
k
k
-clique problem, and show that solving
k
k
k
-cut is likely to require time
Ω
(
n
k
)
\Omega(n^k)
Ω
(
n
k
)
. Recent results of Gupta, Lee & Li have given special-purpose algorithms that solve the problem in time
n
1.98
k
+
O
(
1
)
n^{1.98k + O(1)}
n
1.98
k
+
O
(
1
)
, and ones that have better performance for special classes of graphs (e.g., for small integer weights). In this work, we resolve the problem for general graphs, by showing that the Contraction Algorithm of Karger outputs any fixed
k
k
k
-cut of weight
α
λ
k
\alpha \lambda_k
α
λ
k
​
with probability
Ω
k
(
n
−
α
k
)
\Omega_k(n^{-\alpha k})
Ω
k
​
(
n
−
α
k
)
, where
λ
k
\lambda_k
λ
k
​
denotes the minimum
k
k
k
-cut size. This also gives an extremal bound of
O
k
(
n
k
)
O_k(n^k)
O
k
​
(
n
k
)
on the number of minimum
k
k
k
-cuts and an algorithm to compute a minimum
k
k
k
-cut in similar runtime. Both are tight up to lower-order factors, with the algorithmic lower bound assuming hardness of max-weight
k
k
k
-clique. The first main ingredient in our result is a fine-grained analysis of how the graph shrinks -- and how the average degree evolves -- in the Karger process. The second ingredient is an extremal bound on the number of cuts of size less than
2
λ
k
/
k
2 \lambda_k/k
2
λ
k
​
/
k
, using the Sunflower lemma.Comment: Final version of arXiv:1911.09165 with new and more general proof
Similar works
Full text
Available Versions
arXiv.org e-Print Archive
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:arXiv.org:2005.08301
Last time updated on 19/05/2020