Faster approximate multicommodity flow using quadratically coupled flows

The maximum multicommodity flow problem is a natural generalization of the maximum flow problem to route multiple distinct flows. Obtaining a 1-ε approximation to the multicommodity flow problem on graphs is a well-studied problem. In this paper we present an adaptation of recent advances in single-commodity flow algorithms to this problem. As the underlying linear systems in the electrical problems of multicommodity flow problems are no longer Laplacians, our approach is tailored to generate specialized systems which can be preconditioned and solved efficiently using Laplacians. Given an undirected graph with m edges and k commodities, we give algorithms that find 1-ε approximate solutions to the maximum concurrent flow problem and maximum weighted multicommodity flow problem in time O(m4/3poly(k,ε-1)).

[1]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[2]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[3]  B. Rothschild,et al.  Feasibility of Two Commodity Network Flows , 1966, Oper. Res..

[4]  Aleksander Madry,et al.  Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms , 2010, STOC '10.

[5]  Bruce Hendrickson,et al.  Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners , 2004, SIAM J. Numer. Anal..

[6]  Sanjeev Arora,et al.  A combinatorial, primal-dual approach to semidefinite programs , 2007, STOC '07.

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

[8]  Gary L. Miller,et al.  Solving SDD linear systems in time $\tilde{O}(m\log{n}\log(1/\epsilon))$ , 2011 .

[9]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[10]  Shing-Tung Yau,et al.  Reducing the Symmetric Matrix Eigenvalue Problem to Matrix Multiplications , 1993, SIAM J. Sci. Comput..

[11]  Shang-Hua Teng,et al.  Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs , 2010, STOC '11.

[12]  Gary L. Miller,et al.  Approaching Optimality for Solving SDD Linear Systems , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[13]  G. Miller,et al.  Solving Sdd Linear Systems in Time˜o , 2022 .

[14]  Daniel A. Spielman,et al.  Support-Graph Preconditioners for 2-Dimensional Trusses , 2007, ArXiv.

[15]  Daniel A. Spielman,et al.  Faster approximate lossy generalized flow via interior point algorithms , 2008, STOC.

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

[17]  Gary L. Miller,et al.  Approaching optimality for solving SDD systems , 2010, ArXiv.

[18]  A. George,et al.  Graph theory and sparse matrix computation , 1993 .

[19]  Pravin M. Vaidya,et al.  Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.

[20]  Sivan Toledo,et al.  Effective Stiffness: Generalizing Effective Resistance Sampling to Finite Element Matrices , 2011, ArXiv.

[21]  Shang-Hua Teng,et al.  Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems , 2006, SIAM J. Matrix Anal. Appl..

[22]  Richard Szeliski,et al.  A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[23]  J. Laurie Snell,et al.  Markov Random Fields and Their Applications , 1980 .

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

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