Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow problems. Each electrical flow is given by the solution of a system of linear equations in a Laplacian matrix, and thus may be...
Main Authors: | Christiano, Paul F. (Contributor), Kelner, Jonathan Adam (Contributor), Madry, Aleksander (Contributor), Spielman, Daniel A. (Author), Teng, Shang-Hua (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Department of Mathematics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery,
2012-07-18T20:23:57Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
by: Lee, Yin Tat, et al.
Published: (2015) -
Faster approximate multicommodity flow using quadratically coupled flows
by: Miller, Gary L., et al.
Published: (2013) -
Faster generation of random spanning trees
by: Kelner, Jonathan Adam, et al.
Published: (2010) -
Computing Maximum Flow with Augmenting Electrical Flows
by: Madry, Aleksander
Published: (2017) -
Computing Maximum Flow with Augmenting Electrical Flows
by: Madry, Aleksander
Published: (2018)