Nearly maximum flows in nearly linear time

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2013, Pages 263-269

  Sherman, Jonah ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR TIME CONSTRUCTION; MAXIMUM FLOW PROBLEMS; OBLIVIOUS ROUTING; POTENTIAL FUNCTION; RESIDUAL DEMAND; SIMPLE ALGORITHM; SIMPLER ALGORITHMS; UNDIRECTED GRAPH;

ALGORITHMS; COMPUTER SCIENCE; FORESTRY; GRAPHIC METHODS; OPTIMIZATION; TREES (MATHEMATICS);

FLOW GRAPHS;

ALGORITHMS; FORESTRY; OPTIMIZATION;

EID: 84893494219     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2013.36     Document Type: Conference Paper

References (13)

1. A. V. Goldberg and S. Rao, "Beyond the flow decomposition barrier, " J. ACM, vol. 45, no. 5, pp. 783-797, 1998.
2. D. R. Karger and M. S. Levine, "Finding maximum flows in undirected graphs seems easier than bipartite matching, " in STOC, J. S. Vitter, Ed. ACM, 1998, pp. 69-78.
3. A. A. Benczúr and D. R. Karger, "Randomized approximation schemes for cuts and flows in capacitated graphs, " CoRR, vol. cs.DS/0207078, 2002.
4. P. Christiano, J. A. Kelner, A. Madry, D. A. Spielman, and S.-H. Teng, "Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs, " in STOC, L. Fortnow and S. P. Vadhan, Eds. ACM, 2011, pp. 273-282.
5. D. A. Spielman and S.-H. Teng, "Nearly-linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems, " CoRR, vol. abs/cs/0607105, 2006.
6. J. A. Kelner, L. Orecchia, Y. Tat Lee, and A. Sidford, "An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations, " ArXiv e-prints, Apr. 2013.
7. A. Madry, "Fast approximation algorithms for cut-based problems in undirected graphs, " in FOCS. IEEE Computer Society, 2010, pp. 245-254.
8. Y. Nesterov, "Smooth minimization of non-smooth functions, " Math. Program., vol. 103, no. 1, pp. 127-152, May 2005. [Online]. Available: http://dx.doi.org/10.1007/s10107-004-0552-5.
9. T. Leighton and S. Rao, "Multicommodity max-flow mincut theorems and their use in designing approximation algorithms, " J. ACM, vol. 46, no. 6, pp. 787-832, 1999.
10. C. Harrelson, K. Hildrum, and S. Rao, "A polynomial-time tree decomposition to minimize congestion, " in Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, ser. SPAA '03. New York, NY, USA: ACM, 2003, pp. 34-43. [Online]. Available: http://doi.acm.org/10.1145/777412.777419.
11. M. Bienkowski, M. Korzeniowski, and H. Räcke, "A practical algorithm for constructing oblivious routing schemes, " in SPAA. ACM, 2003, pp. 24-33.
12. I. Koutis, G. L. Miller, and R. Peng, "A fast solver for a class of linear systems, " Commun. ACM, vol. 55, no. 10, pp. 99-107, 2012.
13. J. A. Kelner, L. Orecchia, A. Sidford, and Z. A. Zhu, "A simple, combinatorial algorithm for solving sdd systems in nearly-linear time, " CoRR, vol. abs/1301.6628, 2013.