论文信息 - Two-Commodity Flow

Two-Commodity Flow

An algorithm is given to fmd maxtmum two-commodity flow m an undirected graph The algorithm is an improvement on Hu's two-commodity flow algorithm using the methods of Dmlc's single-commodity flow algorithm Karzanov's Improvement of Dmlc's algorithm can be applied to yield an O(I V ) 3) algorithm. It is shown that finding maximum two-commodity flow m a dwected graph is much more dffficuh, in fact it Is as difficult as hnear programming FmaUy, the problem of finding feasible flow m an undirected graph with lower and upper bounds on the edges is shown to be NP-complete even for a single commodity

Alon Itai | A. Itai

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

[2] Norman Zadeh,et al. A bad network problem for the simplex method and other minimum cost flow algorithms , 1973, Math. Program..

[3] Alon Itai,et al. On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[4] Journal of the Association for Computing Machinery , 1961, Nature.

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

[6] Norman Zadeh,et al. Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows , 1972, JACM.

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

[8] V. Klee,et al. HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .

[9] T. C. Hu. Multi-Commodity Network Flows , 1963 .

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

[11] Richard E. Ladner,et al. On the Structure of Polynomial Time Reducibility , 1975, JACM.