Faster approximate multicommodity flow using quadratically coupled flows Citation
نویسندگان
چکیده
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 the maximum weighted multicommodity flow problem in time Õ(mpoly(k, ǫ)) . Partially supported by the National Science Foundation under grant number CCF-1018463. Partially supported by NFS Awards 0843915 and 1111109 Supported by a Microsoft Fellowship Part of this work was done while at Microsoft Research New England We use Õ(f(m)) to denote Õ(f(m) log f(m)) for some constant c
منابع مشابه
M ay 2 01 2 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 p...
متن کاملFaster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different approach to these problems which yields faster and much simpler algorithms. Our approach also allows us to substitute shortest path computations for min-cost flow computations in computing maximum concurrent flow and min...
متن کاملAn Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
In this paper, we introduce a new framework for approximately solving flow problems in capacitated, undirected graphs and apply it to provide asymptotically faster algorithms for the maximum s-t flow and maximum concurrent multicommodity flow problems. For graphs with n vertices and m edges, it allows us to find an ε-approximate maximum s-t flow in time O(m1+o(1)ε−2), improving on the previous ...
متن کاملApproximate Minimum - Cost Multicommodity Flows in ~ O ( " � 2 Knm ) Time
We show that an "-approximate solution of the cost-constrained K-commodity ow problem on an N-nodeM-arc network G can be computed by sequentially solving O K(" 2 + logK) logM log(" 1 K) single-commodity minimum-cost ow problems on the same network. In particular, an approximate minimumcost multicommodity ow can be computed in ~ O(" 2 KNM) running time, where the notation ~ O( ) means \up to log...
متن کاملSecond-Order Methods for Distributed Approximate Single- and Multicommodity Flow
We study local-control algorithms for maximum flow and multicommodity flow problems in distributed networks. We propose a second-order method for accelerating the convergence of the “first-order” distributed algorithms recently proposed by Awerbuch and Leighton. Our experimental study shows that second-order methods are significantly faster than the first-order methods for approximate singleand...
متن کامل