Faster approximation schemes for fractional multicommodity flow problems

We present fully polynomial approximation schemes for concurrent multicommodity flow problems that run in time independent of the number of commodities k. We show that by modifying the algorithms by Garg & Köönemann [5] and Fleischer [3] we can reduce their running time to a logarithmic dependence on k, and essentially match the running time of [3] for the maximum multicommodity flow problem.

[1]  Satish Rao,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.

[2]  Lisa Fleischer,et al.  Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..

[3]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[4]  Leonid Khachiyan,et al.  Approximate minimum-cost multicommodity flows in , 1996 .

[5]  Éva Tardos,et al.  Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..

[6]  David B. Shmoys,et al.  Cut problems and their application to divide-and-conquer , 1996 .

[7]  Yuval Rabani,et al.  An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..

[8]  Sanjeev Arora,et al.  0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n2) Time , 2004, FOCS.

[9]  Leonid Khachiyan,et al.  Approximate minimum-cost multicommodity flows in $$\tilde O$$ (ɛ−2KNM) timetime , 1996, Math. Program..

[10]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[11]  Neal E. Young,et al.  Randomized rounding without solving the linear program , 1995, SODA '95.

[12]  Leonid Khachiyan,et al.  Coordination Complexity of Parallel Price-Directive Decomposition , 1996, Math. Oper. Res..

[13]  Philip N. Klein,et al.  On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms , 1999, SIAM J. Comput..

[14]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[15]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[16]  Sanjeev Arora,et al.  O(/spl radic/log n) approximation to SPARSEST CUT in O/spl tilde/(n/sup 2/) time , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[17]  Philip N. Klein,et al.  Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts , 1994, SIAM J. Comput..

[18]  Leonid Khachiyan,et al.  Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints , 1994, SIAM J. Optim..

[19]  Tomasz Radzik.  Fast deterministic approximation for the multicommodity flow problem , 1995, SODA '95.

[20]  Lisa Fleischer,et al.  Fast and simple approximation schemes for generalized flow , 2002, Math. Program..

[21]  David R. Karger,et al.  Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows , 1995, STOC '95.

[22]  Elad Hazan,et al.  O(/spl radic/log n) approximation to SPARSEST CUT in O/spl tilde/(n/sup 2/) time , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

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

[24]  Fillia Makedon,et al.  Fast Approximation Algorithms for Multicommodity Flow Problems , 1995, J. Comput. Syst. Sci..