A new approach to the minimum cut problem

@article{Karger1996ANA,
  title={A new approach to the minimum cut problem},
  author={David R. Karger and Clifford Stein},
  journal={J. ACM},
  year={1996},
  volume={43},
  pages={601-640}
}
This paper present a new approach to finding minimum cuts in undirected graphs. The fundamental principle is simple: the edges in a graph's minimum cut form an extremely small fraction of the graph's edges. Using this idea, we give a randomized, strongly polynomial algorithm that finds the minimum cut in an arbitrarily weighted undirected graph with high probability. The algorithm runs in <italic>O(n<supscrpt>2</supscrpt>log<supscrpt>3</supscrpt>n)</italic> time, a significant improvement over… 

Figures from this paper

Minimum cuts in near-linear time
TLDR
A "semiduality" between minimum cuts and maximum spanning tree packings combined with the previously developed random sampling techniques is used and known time bounds for solving the minimum cut problem on undirected graphs are significantly improved.
A Simple Algorithm for Minimum Cuts in Near-Linear Time
TLDR
A self-contained version of Karger's algorithm is given with a new procedure, which produces a minimum cut on an m-edge, n-vertex graph in O(m \log^3 n) time with high probability, matching the complexity ofKarger's approach.
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
TLDR
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.
An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts
TLDR
This paper presents the first algorithm for the tight case of k'=\lfloor k/2\rfloor and can enumerate all minimum k-way cuts, which improves all the previously known divide-and-conquer algorithms for this problem.
Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time
We present a deterministic near-linear time algorithm that computes the edge-connectivity and finds a minimum cut for a simple undirected unweighted graph G with n vertices and m edges. This is the
Practical Minimum Cut Algorithms
TLDR
This work introduces a linear-time algorithm to compute near-minimum cuts based on cluster contraction using label propagation and Padberg and Rinaldi’s contraction heuristics and achieves a lower running time and better parallel scalability at the expense of a higher error rate.
Shared-Memory Exact Minimum Cuts
TLDR
This paper engineer the fastest known exact algorithm for the minimum cut problem for an undirected edge-weighted graph by using a recently developed fast and parallel inexact minimum cut algorithm and using reductions that depend on this bound to reduce the size of the graph much faster than previously possible.
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs
TLDR
A simple deterministic O(n)-time divide-and-conquer algorithm for finding minimum cuts in planar graphs that uses shortest paths in the dual graphs to partition the problem, and uses the relationship between minimumCuts in primal graphs and shortest Paths inDual graphs to find minimum cuts that cross the partitions efficiently.
Minimum k-way cuts via deterministic greedy tree packing
TLDR
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.
The number of minimum k-cuts: improving the Karger-Stein bound
TLDR
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.
...
...

References

SHOWING 1-10 OF 128 REFERENCES
An Õ(n2) algorithm for minimum cuts
TLDR
This paper presents the first algorithm that breaks the tl(mn) “max-flow barrier” for finding minimum cuts in weighted undirected graphs by giving a strongly polynomial randomized algorithm which finds a minimum cut with high probability in 0(n2 log3 n) time.
An NC Algorithm for Minimum Cuts
TLDR
The minimum-cut problem for weighted undirected graphs can be solved in $\NC$ using three separate and independently interesting results, and the set-isolation approach will prove useful in other derandomization problems.
The complexity of multiway cuts (extended abstract)
TLDR
It is shown that the Multiway Cut problem becomes NP-hard as soon as k = 3, but can be solved in polynomial time for planar graphs for any fixed <italic>k</italic>, and a simple approximation algorithm is described that is guaranteed to come within a factor of 2–2/k of the optimal cut weight.
A new approach to the maximum-flow problem
TLDR
An alternative method based on the preflow concept of Karzanov, which runs as fast as any other known method on dense graphs, achieving an O(n) time bound on an n-vertex graph and faster on graphs of moderate density.
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
TLDR
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.
Minimum cuts in near-linear time
  • D. Karger
  • Computer Science, Mathematics
    STOC '96
  • 1996
TLDR
A "semiduality" between minimum cuts and maximum spanning tree packings combined with the previously developed random sampling techniques is used to improve known time bounds for solving the minimum cut problem on undirected graphs.
An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM (extended abstract)
TLDR
Improving a long chain of works, a randomized EREW PRAM algorithm is obtained for finding the connected components of a graph G=(V,E) with n vertices and m edges in O(log <italic>n</italic) time using an optimal number of O (+ m + log log) processors.
Using randomized sparsification to approximate minimum cuts
TLDR
It is shown that a cut of weight within a (1 + 6) multiplicative factor of the minimum cut in a graph can be found in O(m + n(log3 n)/e*) time; thus any constant factor approximation can be achieved in d(m) time.
A simple min-cut algorithm
TLDR
An algorithm for finding the minimum cut of an undirected edge-weighted graph that has a short and compact description, is easy to implement, and has a surprisingly simple proof of correctness.
Random sampling in cut, flow, and network design problems
  • D. Karger
  • Computer Science, Mathematics
    STOC '94
  • 1994
TLDR
It is shown that the sparse graph, or skeleton, that arises when the authors randomly sample a graph's edges will accurately approximate the value of all cuts in the original graph with high probability, which makes sampling effective for problems involving cuts in graphs.
...
...