论文信息 - Efficiency of the network simplex algorithm for the maximum flow problem

Efficiency of the network simplex algorithm for the maximum flow problem

Goldfarb and Hao have proposed a network simplex algorithm that will solve a maximum flow problem on an n-vertex, m-arc network in at most nm pivots and O(n2m) time. In this paper we describe how to implement their algorithm to run in O(nm log n) time by using an extension of the dynamic tree data structure of Sleator and Tarjan. This bound is less than a logarithmic factor larger than that of any other known algorithm for the problem.

A. Goldberg | R. Tarjan | M. Grigoriadis

[1] D. R. Fulkerson,et al. Computation of maximal flows in networks , 1955 .

[2] William H. Cunningham,et al. A network simplex method , 1976, Math. Program..

[3] R. V. Helgason,et al. Algorithms for network programming , 1980 .

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

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

[6] R. Tarjan. Amortized Computational Complexity , 1985 .

[7] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.

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

[9] Donald Goldfarb,et al. A computational comparison of the dinic and network simplex methods for maximum flow , 1988 .

[10] 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 .

[11] Donald Goldfarb,et al. A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n2m) time , 1990, Math. Program..

[12] Robert E. Tarjan,et al. Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem , 1991, Math. Oper. Res..