A Fast Parametric Maximum Flow Algorithm and Applications

The classical maximum flow problem sometimes occurs in settings in which the arc capacities are not fixed but are functions of a single parameter, and the goal is to find the value of the parameter such that the corresponding maximum flow or minimum cut satisfies some side condition. Finding the desired parameter value requires solving a sequence of related maximum flow problems. In this paper it is shown that the recent maximum flow algorithm of Goldberg and Tarjan can be extended to solve an important class of such parametric maximum flow problems, at the cost of only a constant factor in its worst-case time bound. Faster algorithms for a variety of combinatorial optimization problems follow from the result.

[1]  Klaus Ritter.  Ein Verfahren zur Lösung parameterabhängiger, nichtlinearer Maximum-Probleme , 1962, Unternehmensforschung.

[2]  C. Nash-Williams.  Decomposition of Finite Graphs Into Forests , 1964 .

[3]  J. Edmonds.  Minimum partition of a matroid into independent subsets , 1965 .

[4]  K. Ritter,et al.  A Parametric Method for Semidefinite Quadratic Programs , 1969 .

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

[6]  J. Rhys.  A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .

[7]  M. Desu.  A Selection Problem , 1970 .

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

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

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

[11]  S. Schaible.  Fractional Programming. II, On Dinkelbach's Algorithm , 1976 .

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

[13]  J. Picard.  Maximal Closure of a Graph and Applications to Combinatorial Problems , 1976 .

[14]  N. Megiddo.  A GOOD ALGORITHM FOR LEXICOGRAPHICALLY OPTIMAL FLOWS IN MULTI-TERMINAL NETWORKS , 1977 .

[15]  E. Lawler.  Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

[16]  Nimrod Megiddo,et al.  Combinatorial optimization with rational objective functions , 1978, Math. Oper. Res..

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

[18]  J. Randall Brown,et al.  The Sharing Problem , 1979, Oper. Res..

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

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

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

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

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

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

[25]  Dan Gusfield,et al.  Parametric Combinatorial Computing and a Problem of Program Module Distribution , 1983, JACM.

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

[27]  Donald M. Topkis,et al.  Activity selection games and the minimum-cut problem , 1983, Networks.

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

[29]  Manfred W. Padberg,et al.  Fractional covers for forests and matchings , 1984, Math. Program..

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

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

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

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

[34]  Charles U. Martel,et al.  Fast Algorithms for Bipartite Network Flow , 1987, SIAM J. Comput..

[35]  A. Goldberg,et al.  A new approach to the maximum-flow problem , 1988, JACM.

[36]  P. Hansen,et al.  Best network flow bounds for the quadratic knapsack problem , 1989 .