Some Recent Advances in Network Flows

The literature on network flow problems is extensive, and over the past 40 years researchers have made continuous improvements to algorithms for solving several classes of problems. However, the surge of activity concerning the algorithmic aspects of network flow problems over the past few years has been particularly striking. Several techniques have proven to be very successful in permitting researchers to make these recent contributions: (i) scaling of the problem data; (ii) improved analysis of algorithms, especially amortized worst-case performance and the use of potential functions; and (iii) enhanced data structures. This survey illustrates some of these techniques and their usefulness in developing faster network flow algorithms. The discussion focuses on the design of faster algorithms from the worst-case perspective, and is limited to the following fundamental problems: the shortest path problem, the maximum flow problem, and the minimum cost flow problem. Several representative algorithms from e...

[1]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[2]  Shimon Even,et al.  Graph Algorithms , 1979 .

[3]  Andrew V. Goldberg,et al.  Finding minimum-cost circulations by canceling negative cycles , 1989, JACM.

[4]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[5]  E. Denardo,et al.  Shortest-Route Methods: 1. Reaching, Pruning, and Buckets , 1979, Oper. Res..

[6]  Andrew Vladislav Goldberg,et al.  Efficient graph algorithms for sequential and parallel computers , 1987 .

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

[8]  Éva Tardos,et al.  An O(n2(m + Nlog n)log n) min-cost flow algorithm , 1988, JACM.

[9]  Dimitri P. Bertsekas,et al.  Dual coordinate step methods for linear network flow problems , 1988, Math. Program..

[10]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

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

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

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

[14]  J. Orlin.  Working Paper Alfred P. Sloan School of Management Genuinely Polynominal Simplex and Non-simplex Algorithms for the Minimum Cost Flow Problem Genuinely Polynominal Simplex and Non-simplex Algorithms for the Minimum Cost Flow Problem , 2008 .

[15]  Satoru Fujishige,et al.  A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm , 1986, Math. Program..

[16]  David L. Jensen,et al.  On the computational behavior of a polynomial-time network flow algorithm , 1992, Math. Program..

[17]  G. Dantzig.  On the Shortest Route Through a Network , 1960 .

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

[19]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[20]  Jr. Charles R. Frank,et al.  A Note on the Assortment Problem , 1965 .

[21]  Harold N Gabow.  Scaling Algorithms for Network Problems ; CU-CS-266-84 , 1984 .

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

[23]  U. Pape,et al.  Implementation and efficiency of Moore-algorithms for the shortest route problem , 1974, Math. Program..

[24]  R. Tarjan.  A simple version of Karzanov's blocking flow algorithm , 1984 .

[25]  Arthur M. Farley,et al.  Levelling Terrain Trees: A Transshipment Problem , 1980, Inf. Process. Lett..

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

[27]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[28]  Awi Federgruen,et al.  Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques , 1986 .

[29]  Harold N. Gabow.  Scaling Algorithms for Network Problems , 1985, J. Comput. Syst. Sci..

[30]  Robert B. Dial,et al.  Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[31]  VishkinUzi,et al.  An O(n2 log n) parallel max-flow algorithm , 1982 .

[32]  Kurt Mehlhorn,et al.  Faster algorithms for the shortest path problem , 1990, JACM.

[33]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[34]  Peter Elias,et al.  A note on the maximum flow through a network , 1956, IRE Trans. Inf. Theory.

[35]  J. A. Hillier,et al.  A Method for Finding the Shortest Route Through a Road Network , 1960 .

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

[37]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[38]  Robert G. Busacker,et al.  A PROCEDURE FOR DETERMINING A FAMILY OF MINIMUM-COST NETWORK FLOW PATTERNS , 1960 .

[39]  Éva Tardos,et al.  A strongly polynomial minimum cost circulation algorithm , 1985, Comb..

[40]  M. Klein.  A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems , 1966 .

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

[42]  D. R. Fulkerson,et al.  On the Max Flow Min Cut Theorem of Networks. , 1955 .

[43]  L. R. Ford,et al.  NETWORK FLOW THEORY , 1956 .

[44]  Andrew V. Goldberg,et al.  Solving minimum-cost flow problems by successive approximation , 1987, STOC.

[45]  James B. Orlin.  A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..

[46]  D. Bertsekas.  Distributed relaxation methods for linear network flow problems , 1986, 1986 25th IEEE Conference on Decision and Control.