An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2014, Pages 217-226

  Kelner, Jonathan A ^a   Lee, Yin Tat ^a   Orecchia, Lorenzo ^a   Sidford, Aaron ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; GRADIENT METHODS;

EFFICIENT CONSTRUCTION; GRADIENT DESCENT; LINEAR TIME CONSTRUCTION; LINEAR-TIME ALGORITHMS; MAXIMUM CONCURRENT FLOW; MULTICOMMODITY FLOW PROBLEMS; OBLIVIOUS ROUTING; UNDIRECTED GRAPH;

FLOW GRAPHS;

EID: 84902105483     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973402.16     Document Type: Conference Paper

References (25)

1. Y. Aumann and Y. Rabani. An o(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM Journal on Computing, 27(1):291-301, 1998.
2. 2) time. In STOC'96: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 47-55, New York, NY, USA, 1996. ACM.
3. Dimitri P Bertsekas. Nonlinear programming. 1999.
4. Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, and Shang-Hua Teng. Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs. In STOC '11, pages 273-282, 2011.
5. Andrew V. Goldberg and Satish Rao. Beyond the flow decomposition barrier. J. ACM, 45(5):783-797, 1998.
6. Jonathan A. Kelner and Petar Maymounkov. Electric routing and concurrent flow cutting. CoRR, abs/0909.2859, 2009.
7. Jonathan A. Kelner, Gary L. Miller, and Richard Peng. Faster approximate multicommodity flow using quadratically coupled flows. In Proceedings of the 44th symposium on Theory of Computing, STOC '12, pages 1-18, New York, NY, USA, 2012. ACM.
8. Jonathan A. Kelner, Lorenzo Orecchia, Yin Tat Lee, and Aaron Sidford. An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations. CoRR, abs/1304.2338, 2013.
9. Jonathan A. Kelner, Lorenzo Orecchia, Aaron Sidford, and Zeyuan Allen Zhu. A simple, combinatorial algorithm for solving sdd systems in nearly-linear time. CoRR, abs/1301.6628, 2013.
10. Ioannis Koutis, Gary L. Miller, and Richard Peng. Approaching optimality for solving SDD linear systems. In Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS '10, pages 235-244, Washington, DC, USA, 2010. IEEE Computer Society.
11. Ioannis Koutis, Gary L. Miller, and Richard Peng. Approaching optimality for solving SDD systems. In Proceedings of the 51st Annual Symposium on Foundations of Computer Science, 2010.
12. Ioannis Koutis, Gary L. Miller, and Richard Peng. A nearly-m log n time solver for SDD linear systems. In Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS '11, pages 590-598, Washington, DC, USA, 2011. IEEE Computer Society.
13. Gregory Lawler and Hariharan Narayanan. Mixing times and lp bounds for oblivious routing. In WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS, (ANALCO 09) 4, 2009.
14. Yin Tat Lee, Satish Rao, and Nikhil Srivastava. A New Approach to Computing Maximum Flows using Electrical Flows. Proceedings of the 45th symposium on Theory of Computing - STOC '13, 2013.
15. Yin Tat Lee and Aaron Sidford. Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems. In Proceedings of the 2013 IEEE 54st Annual Symposium on Foundations of Computer Science, FOCS '13. IEEE Computer Society, 2013.
16. F. Thomson Leighton and Ankur Moitra. Extensions and limits to vertex sparsification. In Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pages 47-56, New York, NY, USA, 2010. ACM.
17. Aleksander Madry. Fast approximation algorithms for cut-based problems in undirected graphs. In Proceedings of the 51st Annual Symposium on Foundations of Computer Science, 2010.
18. Aleksander Madry. Fast approximation algorithms for cut-based problems in undirected graphs. CoRR, abs/1008.1975, 2010.
19. Yu Nesterov. Smooth minimization of non-smooth functions. Mathematical Programming, 103(1):127- 152, 2005.
20. Yurii Nesterov. Efficiency of coordinate descent meth ods on huge-scale optimization problems. Core discussion papers, 2:2010, 2010.
21. Harald Racke. Optimal hierarchical decompositions for congestion minimization in networks. In Proceedings of the 40th annual ACM symposium on Theory of computing, STOC '08, pages 255-264, New York, NY, USA, 2008. ACM.
22. Jonah Sherman. Nearly maximum flows in nearly linear time. In Proceedings of the 54th Annual Symposium on Foundations of Computer Science, 2013.
23. Daniel A. Spielman and Shang-Hua Teng. Nearly- linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 81-90, New York, NY, USA, 2004. ACM.
24. Daniel A. Spielman and Shang-Hua Teng. Nearly- linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems. CoRR, abs/cs/0607105, 2006.
25. Daniel A. Spielman and Shang-Hua Teng. Spectral sparsification of graphs. CoRR, abs/0808.4134, 2008.