Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms

We combine the work of Garg and Konemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1-ε)-approximation schemes for various versions of the multicommodity flow problem. In particular, if ε is moderately small and the size of every number used in the input instance is polynomially bounded, the running times of our algorithms match -- up to poly-logarithmic factors and some provably optimal terms -- the Ω(mn) flow-decomposition barrier for single-commodity flow.

[1]  Andrew V. Goldberg.  A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms , 1992, Inf. Process. Lett..

[2]  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).

[3]  Uri Zwick,et al.  Improved Dynamic Reachability Algorithms for Directed Graphs , 2008, SIAM J. Comput..

[4]  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..

[5]  Andrew V. Goldberg,et al.  Beyond the flow decomposition barrier , 1998, JACM.

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

[7]  Giuseppe F. Italiano,et al.  Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

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

[9]  Uri Zwick,et al.  A fully dynamic reachability algorithm for directed graphs with an almost linear update time , 2004, STOC '04.

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

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

[12]  G. Glauberman.  Proof of Theorem A , 1977 .

[13]  Yurii Nesterov,et al.  Smooth minimization of non-smooth functions , 2005, Math. Program..

[14]  Ramesh Hariharan,et al.  Maintaining all-pairs approximate shortest paths under deletion of edges , 2003, SODA '03.

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

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

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

[18]  George Karakostas,et al.  Faster approximation schemes for fractional multicommodity flow problems , 2008, TALG.

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

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

[21]  Uri Zwick,et al.  On Dynamic Shortest Paths Problems , 2004, Algorithmica.

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

[23]  Giuseppe F. Italiano,et al.  On-Line Computation of Minimal and Maximal Length Paths , 1992, Theor. Comput. Sci..

[24]  Daniel Bienstock,et al.  Solving fractional packing problems in Oast(1/ε) iterations , 2004, STOC '04.

[25]  Giuseppe F. Italiano,et al.  A new approach to dynamic all pairs shortest paths , 2003, STOC '03.

[26]  Giuseppe F. Italiano,et al.  Fully dynamic all pairs shortest paths with real edge weights , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[27]  Uri Zwick,et al.  Dynamic approximate all-pairs shortest paths in undirected graphs , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[28]  Éva Tardos,et al.  Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[29]  Ramesh Hariharan,et al.  Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths , 2002, STOC '02.

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

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

[32]  Shimon Even,et al.  An On-Line Edge-Deletion Problem , 1981, JACM.

[33]  Sanjeev Arora,et al.  The Multiplicative Weights Update Method: a Meta-Algorithm and Applications , 2012, Theory Comput..