Experimental Study of Minimum Cut Algorithms (1997)

by Chandra S. Chekuri , Andrew V. Goldberg , David R. Karger , Matthew S. Levine , Cliff Stein
Venue:PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA)
Citations:40 - 2 self

Active Bibliography

98 A new approach to the minimum cut problem – David R. Karger, Clifford Stein - 1996
23 Recent Developments in Maximum Flow Algorithms – Andrew V. Goldberg - 1998
4 Practical Performance of Efficient Minimum Cut Algorithms – Michael Jünger, Giovanni Rinaldi, Stefan Thienel - 1997
19 Generalized Maximum Flow Algorithms – Kevin Daniel Wayne - 1999
10 Length Functions for Flow Computations – Andrew V. Goldberg, Satish Rao - 1997
71 Minimum Cuts in Near-Linear Time – David R. Karger - 1999
20 Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time – L. Fleischer - 1998
5 Exact and Approximation Algorithms for Network Flow and Disjoint-Path Problems – Stavros G. Kolliopoulos - 1998
Combinatorial Optimization (Lecture Notes) – Andrew V. Goldberg
5 Maximum flows by incremental breadth-first search – Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert E. Tarjan, Renato F. Werneck - 2011
20 Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization – Michael Jünger, Gerhard Reinelt, Stefan Thienel - 1994
39 Network Flow Algorithms – Andrew V. Goldberg, Eva Tardos, Robert E. Tarjan
3 Parallel and Fast Sequential Algorithms for Undirected Edge Connectivity Augmentation – András A. Benczúr - 1999
Network Design – J. Cheriyan, R. Ravi - 1998
1 Approximating s-t Minimum Cuts in Õ(n²) Time – Andras A. Benczur, David R. Karger
Minimum Cuts – Michel X. Goemans - 1996
6.1 Maximum Flows – Michel X. Goemans - 2009
unknown title – Lecturer Michel, X. Goemans, Scribe Roberto, De Prisco
4 Augmenting undirected connectivity in RNC and in randomized O(n3) time – András A. Benczúr - 1994