RECENT DEVELOPMENTS IN MAXIMUM FLOW ALGORITHMS

Goldberg and Rao recently proposed the blocking flow method based on a binary length function to obtain a better algorithm for the maximum flow problem. The previous algorithms based on the blocking flow method proposed by Dinic use the unit length function: every residual edge is of length 1. In this paper, we survey properties of the distance function defined by a length function and give an overview on the representative maximum flow algorithms proposed so far in a systematic way by utilizing these properties. Among them are included two new algorithms: the Goldberg-Rao algorithm which finds a maximum flow on an integral capacity network N of n vertices and m edges in ~(min{ml/~, n2/3}7n log(n2/m) log U) time, where U is the maximum edge capacity of N, and the Karger-Levine algorithm which finds a maximum flow on an undirected network N with unit capacity and no parallel edges in 0(m + nv3/2) time, where v is the value of a maximum flow of N.

[1]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[2]  David R. Karger,et al.  Minimum cuts in near-linear time , 1998, JACM.

[3]  David R. Karger,et al.  Finding maximum flows in undirected graphs seems easier than bipartite matching , 1998, STOC '98.

[4]  Steven J. Phillips,et al.  On-Line Load Balancing and Network Flow , 1993, Algorithmica.

[5]  David R. Karger.  Better random sampling algorithms for flows in undirected graphs , 1998, SODA '98.

[6]  Andrew V. Goldberg,et al.  On Implementing the Push—Relabel Method for the Maximum Flow Problem , 1997, Algorithmica.

[7]  Andrew V. Goldberg,et al.  Beyond the flow decomposition barrier , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[8]  Andrew V. Goldberg,et al.  Flows in undirected unit capacity networks , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[9]  David R. Karger,et al.  Using random sampling to find maximum flows in uncapacitated undirected graphs , 1997, STOC '97.

[10]  David R. Karger,et al.  Minimum cuts in near-linear time , 1996, STOC '96.

[11]  David R. Karger,et al.  Approximating s – t Minimum Cuts in ~ O(n 2 ) Time , 2007 .

[12]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[13]  Robert E. Tarjan,et al.  A faster deterministic maximum flow algorithm , 1992, SODA '92.

[14]  Andrew V. Goldberg,et al.  Finding Minimum-Cost Circulations by Successive Approximation , 1990, Math. Oper. Res..

[15]  Noga Alon,et al.  Generating Pseudo-Random Permutations and Maximum Flow Algorithms , 1990, Inf. Process. Lett..

[16]  Kurt Mehlhorn,et al.  Can A Maximum Flow be Computed on o(nm) Time? , 1990, ICALP.

[17]  Robert E. Tarjan,et al.  Improved Time Bounds for the Maximum Flow Problem Improved Time Bounds for the Maximum Flow Problem Improved Time Bounds for the Maximum Flow Problem , 2008 .

[18]  Ravindra K. Ahuja,et al.  A Fast and Simple Algorithm for the Maximum Flow Problem , 2011, Oper. Res..

[19]  Torben Hagerup,et al.  A randomized maximum-flow algorithm , 1989, 30th Annual Symposium on Foundations of Computer Science.

[20]  Robert E. Tarjan,et al.  Network Flow Algorithms , 1989 .

[21]  S. N. Maheshwari,et al.  Analysis of Preflow Push Algorithms for Maximum Network Flow , 1988, SIAM J. Comput..

[22]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[23]  Harold N. Gabow,et al.  Scaling algorithms for network problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[24]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[25]  Hiroshi Imai,et al.  ON THE PRACTICAL EFFICIENCY OF VARIOUS MAXIMUM FLOW ALGORITHMS , 1983 .

[26]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[27]  Amnon Naamad,et al.  An O(EVlog²V) Algorithm for the Maximal Flow Problem , 1980, J. Comput. Syst. Sci..

[28]  S. N. Maheshwari,et al.  An O(|V|³) Algorithm for Finding Maximum Flows in Networks , 1978, Inf. Process. Lett..

[29]  Robert E. Tarjan,et al.  Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..

[30]  A. V. Karzanov,et al.  Determining the maximal flow in a network by the method of preflows , 1974 .

[31]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[32]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[33]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956, Canadian Journal of Mathematics.