A representation of cuts within 6/5 times the edge connectivity with applications

Let G be an undirected c-edge connected graph. In this paper we give an O(n/sup 2/)-sized planar geometric representation for all edge cuts with capacity less than 6/5c. The representation can be very efficiently built, by using a single run of the Karger-Stein algorithm for finding near-mincuts. We demonstrate that the representation provides an efficient query structure for near-mincuts, as well as a new proof technique through geometric arguments. We show that in algorithms based on edge splitting, computing our representation O(log n) times substitute for one, or sometimes even /spl Omega/(n), u-/spl nu/ mincut computations; this can lead to significant savings, since our representation can be computed /spl theta//spl tilde/(m/n) times faster than the currently best known u-/spl nu/ mincut algorithm. We also improve the running time of the edge augmentation problem, provided the initial edge weights are polynomially bounded.

[1]  Giovanni Rinaldi,et al.  Facet identification for the symmetric traveling salesman polytope , 1990, Math. Program..

[2]  Mihalis Yannakakis,et al.  Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract) , 1992, ICALP.

[3]  Toshihide Ibaraki,et al.  Computing All Small Cuts in Undirected Networks , 1994, ISAAC.

[4]  András Frank.  Augmenting Graphs to Meet Edge-Connectivity Requirements , 1992, SIAM J. Discret. Math..

[5]  András Frank,et al.  On a theorem of Mader , 1992, Discret. Math..

[6]  A. Frank.  Applications of submodular functions , 1993 .

[7]  A. Benczúr.  The structure of near-minimum edge cuts , 1994 .

[8]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[9]  Harold N. Gabow,et al.  Efficient splitting off algorithms for graphs , 1994, STOC '94.

[10]  Andrr As,et al.  The Structure of Near-minimum Edge Cuts , 1995 .

[11]  Charles U. Martel,et al.  A fast algorithm for optimally increasing the edge-connectivity , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[12]  Ketan Mulmuley.  Lower bounds for parallel linear programming and other problems , 1994, STOC '94.

[13]  David R. Karger,et al.  Global min-cuts in RNC, and other ramifications of a simple min-out algorithm , 1993, SODA '93.

[14]  Takahashi Masaya,et al.  2 -Edge- Connectivity Augmentation Problems for Directed Graphs , 1989 .

[15]  W. Mader.  A Reduction Method for Edge-Connectivity in Graphs , 1978 .

[16]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[17]  David R. Karger,et al.  An Õ(n2) algorithm for minimum cuts , 1993, STOC.

[18]  David R. Karger,et al.  Random sampling in cut, flow, and network design problems , 1994, STOC '94.