Experimental Evaluation of a Parametric Flow Algorithm

We study a practical implementation of the parametric flow algorithm of Gallo, Grigoriadis, and Tarjan. We describe an efficient implementation of the algorithm and compare it with a simpler algorithm.

[1]  Alon Itai,et al.  Scheduling Transmissions in a Network , 1985, J. Algorithms.

[2]  P. Hammer,et al.  Quadratic knapsack problems , 1980 .

[3]  William H. Cunningham,et al.  Optimal attack and reinforcement of a network , 1985, JACM.

[4]  Hiroaki Ishii,et al.  Optimal sharing , 1982, Math. Program..

[5]  Harold S. Stone,et al.  Critical Load Factors in Two-Processor Distributed Systems , 1978, IEEE Transactions on Software Engineering.

[6]  David S. Johnson,et al.  Network Flows and Matching: First DIMACS Implementation Challenge , 1993 .

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

[8]  Bin Zhang,et al.  A Simultaneous Parametric Maximum-Flow Algorithm for Finding the Complete Chain of Solutions , 2004 .

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

[10]  Nimrod Megiddo,et al.  Optimal flows in networks with multiple sources and sinks , 1974, Math. Program..

[11]  Jeffrey B. Sidney,et al.  Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..

[12]  Andrew V. Goldberg,et al.  Finding a Maximum Density Subgraph , 1984 .

[13]  Maurice Queyranne,et al.  A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory , 1982, Networks.

[14]  J. Picard,et al.  Selected Applications of Minimum Cuts in Networks , 1982 .

[15]  Bin Zhang,et al.  Simultaneous Parametric Maximum Flow Algorithm with Vertex Balancing , 2005 .

[16]  Robert E. Tarjan,et al.  A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..

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

[18]  Dennis G. Severance,et al.  Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases , 1976, JACM.

[19]  Andrew V. Goldberg,et al.  On Implementing Push-Relabel Method for the Maximum Flow Problem , 1995, IPCO.

[20]  H. D. Ratliff,et al.  Minimum cuts and related problems , 1975, Networks.