[1] 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. CoRR, abs/1010.2921, 2010. [ bib ]
[2] Jonathan A. Kelner, Gary L. Miller, and Richard Peng. Faster approximate multicommodity flow using quadratically coupled flows. In STOC, pages 1--18, 2012. [ bib ]
[3] 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. [ bib ]
[4] Aleksander Madry. Fast approximation algorithms for cut-based problems in undirected graphs. CoRR, abs/1008.1975, 2010. [ bib ]
[5] Daniel A. Spielman and Nikhil Srivastava. Graph sparsification by effective resistances. CoRR, abs/0803.0929, 2008. [ bib ]
[6] 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. [ bib ]
[7] Daniel A Spielman and Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 81--90. ACM, 2004. [ bib ]
[8] Daniel A Spielman and Shang-Hua Teng. Spectral sparsification of graphs. SIAM Journal on Computing, 40(4):981--1025, 2011. [ bib ]

This file was generated by bibtex2html 1.98.