A new approach to computing maximum flows using electrical flows

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2013, Pages 755-764

  Lee, Yin Tat ^a   Rao, Satish ^b   Srivastava, Nikhil ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Electrical flow; Maximum flow; Minimum cut; Nesterov

Indexed keywords

AFFINE SUBSPACES; ELECTRICAL FLOWS; MAXIMUM FLOWS; METHOD OF ALTERNATING PROJECTIONS; MINIMUM CUT; NESTEROV; RELATED ALGORITHMS; UNDIRECTED GRAPH;

ALGORITHMS; COMPUTATION THEORY; SET THEORY;

FLOW GRAPHS;

EID: 84879816334     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488608.2488704     Document Type: Conference Paper

References (17)

1. S. Arora, E. Hazan, and S. Kale. The multiplicative weights update method: A meta-algorithm and applications. Theory OF Computing, 8:121-164, 2012.
2. D. Bienstock and G. Iyengar. Solving fractional packing problems in o ast (1/ε) iterations. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 146-155. ACM, 2004.
3. P. Christiano, J.A. Kelner, A. Madry, D.A. Spielman, and S.H. Teng. Electrical ows, laplacian systems, and faster approximation of maximum ow in undirected graphs. In STOC 2011, pages 273-282. ACM, 2011.
4. A. d'Aspremont. Smooth optimization with approximate gradient. SIAM Journal on Optimization, 19(3):1171-1183, 2008.
5. S.I. Daitch and D.A. Spielman. Faster approximate lossy generalized ow via interior point algorithms. In Proceedings of the 40th annual ACM symposium on Theory of computing, pages 451-460. ACM, 2008.
6. L.R. Ford and D.R. Fulkerson. Maximal ow through a network. Canadian Journal of Mathematics, 8(3):399-404, 1956.
7. A. Goel, M. Kapralov, S. Khanna. Perfect matchings in o (n log n) time in regular bipartite graphs In Proceedings of the 42th annual ACM symposium on Theory of computing, pages 39-46. ACM, 2010.
8. A. Goldberg. Recent developments in maximum ow algorithms. Algorithm Theoryâ ǍŤSWAT'98, pages 1-10, 1998.
9. Andrew V. Goldberg and Satish Rao. Beyond the ow decomposition barrier. J. ACM, 45(5):783-797, 1998.
10. David R. Karger. Better random sampling algorithms for ows in undirected graphs. In SODA, pages 490-499, 1998.
11. David R. Karger and Matthew S. Levine. Random sampling in residual graphs. In STOC 2002, pages 63-66. ACM, 2002.
12. I. Koutis, G.L. Miller, and R. Peng. A nearly-m log n time solver for sdd linear systems. In Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on, pages 590-598. IEEE, 2011.
13. P. Klein and N. Young. On the number of iterations for dantzig-wolfe optimization and packing-covering approximation algorithms. Integer Programming and Combinatorial Optimization, pages 320-327, 1999.
14. Y. Nesterov. Smooth minimization of non-smooth functions. Mathematical Programming, 103(1):127-152, 2005.
15. B.T. Poljak. Introduction to optimization. Optimization Software, 1987.
16. D.D. Sleator and R. Endre Tarjan. A data structure for dynamic trees. Journal of computer and system sciences, 26(3):362-391, 1983.
17. Nisheeth Vishnoi. Lx = b, book manuscript.