Article thumbnail

Faster Approximate Multicommodity Flow Using Quadratically Coupled Flows

By Jonathan A. Kelner, Gary Miller and Richard Peng

Abstract

The maximum multicommodity flow problem is a natural generalization of the maximum flow problem to route multiple distinct flows. Obtaining a $1-\epsilon$ 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-\epsilon$ approximate solutions to the maximum concurrent flow problem and the maximum weighted multicommodity flow problem in time $\tilde{O}(m^{4/3}\poly(k,\epsilon^{-1}))$

Topics: Computer Science - Data Structures and Algorithms
Year: 2012
DOI identifier: 10.1145/2213977.2213979
OAI identifier: oai:arXiv.org:1202.3367

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.