Approximate Undirected Maximum Flows in O(m polylog(n)) Time
Data Structures and Algorithms
2015-11-18 v2
Abstract
We give the first O(m polylog(n)) time algorithms for approximating maximum flows in undirected graphs and constructing polylog(n) -quality cut-approximating hierarchical tree decompositions. Our algorithm invokes existing algorithms for these two problems recursively while gradually incorporating size reductions. These size reductions are in turn obtained via ultra-sparsifiers, which are key tools in solvers for symmetric diagonally dominant (SDD) linear systems.
Cite
@article{arxiv.1411.7631,
title = {Approximate Undirected Maximum Flows in O(m polylog(n)) Time},
author = {Richard Peng},
journal= {arXiv preprint arXiv:1411.7631},
year = {2015}
}