Improved bounds on the max-flow min-cut ratio for multicommodity flows

In this paper we consider the worst case ratio between the capacity of min-cuts and the value of max-flow for multicommodity flow problems. We improve the best known bounds for the min-cut max-flow ratio for multicommodity flows in undirected graphs, by replacing theO(logD) in the bound byO(logk), whereD denotes the sum of all demands, andk demotes the number of commodities. In essence we prove that up to constant factors the worst min-cut max-flow ratios appear in problems where demands are integral and polynomial in the number of commodities.Klein, Rao, Agrawal, and Ravi have previously proved that if the demands and the capacities are integral, then the min-cut max-flow ratio in general undirected graphs is bounded byO(logClogD), whereC denotes the sum of all the capacities. Tragoudas has improved this bound toO(lognlogD), wheren is the number of nodes in the network. Garg, Vazirani and Yannakakis further improved this toO(logklogD). Klein, Plotkin and Rao have proved that for planar networks, the ratio isO(logD).Our result improves the bound for general networks toO(log2k) and the bound for planar networks toO(logk). In both cases our result implies the first non-trivial bound that is independent of the magnitude of the numbers involved. The method presented in this paper can be used to give polynomial time approximation algorithms to the minimum cuts in the network up to the above factors.

[1]  Mihalis Yannakakis,et al.  Approximate max-flow min-(multi)cut theorems and their applications , 1993, SIAM J. Comput..

[2]  Haruko Okamura,et al.  Multicommodity flows in planar graphs , 1981, J. Comb. Theory, Ser. B.

[3]  Satish Rao,et al.  An approximate max-flow min-cut relation for undirected multicommodity flow, with applications , 1995, Comb..

[4]  Paul D. Seymour,et al.  Packing directed circuits fractionally , 1995, Comb..

[5]  Spyros Tragoudas.  VLSI partitioning approximation algorithms based on multicommodity flow and other techniques , 1991 .

[6]  Serge A. Plotkin,et al.  Bounds on the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows , 1993 .

[7]  Fillia Makedon,et al.  Fast approximation algorithms for multicommodity flow problems , 1991, STOC '91.

[8]  Baruch Awerbuch,et al.  Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks , 1994, STOC '94.

[9]  Paul D. Seymour,et al.  Matroids and Multicommodity Flows , 1981, Eur. J. Comb..

[10]  Joseph Naor,et al.  Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs , 1995, IPCO.

[11]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[12]  Éva Tardos,et al.  Improved bounds on the max-flow min-cut ratio for multicommodity flows , 1993, Comb..

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