Approximate minimum cuts and their enumeration
Preprint
Abstract
We show that every $\alpha$-approximate minimum cut in a connected graph is the unique minimum $(S,T)$-terminal cut for some subsets $S$ and $T$ of vertices each of size at most $\lfloor2\alpha\rfloor+1$. This leads to an alternative proof that the number of $\alpha$-approximate minimum cuts in a $n$-vertex connected graph is $n^{O(\alpha)}$ and they can all be enumerated in deterministic polynomial time for constant $\alpha$.
Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- LP Relaxation and Tree Packing for Minimum $k$-CutSIAM Journal on Discrete Mathematics, 2020
- A Deterministic Algorithm for Finding All Minimum k‐Way CutsSIAM Journal on Computing, 2007
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability ProblemSIAM Journal on Computing, 1999
- Computing All Small Cuts in an Undirected NetworkSIAM Journal on Discrete Mathematics, 1997
- A Fast Algorithm for Optimally Increasing the Edge ConnectivitySIAM Journal on Computing, 1997
- A new approach to the minimum cut problemJournal of the ACM, 1996
- Minimizing submodular functions over families of setsCombinatorica, 1995