Approximating the exponential, the Lanczos method and an Õ(m)-time spectral algorithm for balanced separator

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 1141-1159

  Orecchia, Lorenzo ^a   Sachdeva, Sushant ^b   Vishnoi, Nisheeth K ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b PRINCETON UNIVERSITY   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

balanced graph partitioning; lanczos method; matrix exponential; spectral algorithms; uniform approximation

Indexed keywords

BALANCED GRAPH PARTITIONING; LANCZOS METHODS; MATRIX EXPONENTIALS; SPECTRAL ALGORITHM; UNIFORM APPROXIMATION;

COMPUTATION THEORY; GRAPH THEORY; MATRIX ALGEBRA; SEPARATORS; VECTORS;

APPROXIMATION ALGORITHMS;

EID: 84862594387     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2214080     Document Type: Conference Paper

References (36)

1. 1, Isoperimetric inequalities for graphs, and superconcentrators. J. Comb. Theory, Ser. B, 38(1):73-88, 1985.
2. R. Andersen, F. R. K. Chung, and K. J. Lang. Local graph partitioning using pagerank vectors. In FOCS'06: Proc. 47th Ann. IEEE Symp. Foundations of Computer Science, pages 475-486, 2006.
3. R. Andersen and K. J. Lang. An algorithm for improving graph partitions. In SODA'08: Proc. 19th Ann. ACM-SIAM Symp. Discrete Algorithms, SODA '08, pages 651-660, 2008.
4. R. Andersen and Y. Peres. Finding sparse cuts locally using evolving sets. In STOC '09: Proc. 41st Ann. ACM Symp. Theory of Computing, pages 235-244, 2009.
5. S. Arora and S. Kale. A combinatorial, primal-dual approach to semidefinite programs. In STOC '07: Proc. 39th Ann. ACM Symp. Theory of Computing, pages 227-236, 2007.
6. S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. In STOC '04: Proc. 36th Ann. ACM Symp. Theory of Computing, pages 222-231. ACM, 2004.
7. R. Bhatia. Matrix Analysis (Graduate Texts in Mathematics). Springer, 1996.
8. E. W. Cheney. Introduction to approximation theory. McGraw-Hill, New York, 1966.
9. F. R. Chung. Spectral Graph Theory (CBMS Regional Conference Series in Mathematics, No. 92). American Mathematical Society, 1997.
10. B. L. Ehle. A-stable methods and Padéapproximations to the exponential. Siam J. on Mathematical Analysis, 4(4):671-680, 1973.
11. J. v. Eshof and M. Hochbruck. Preconditioning Lanczos approximations to the matrix exponential. SIAM J. Sci. Comput., 27:1438-1457, November 2005.
12. M. Hochbruck and C. Lubich. On krylov subspace approximations to the matrix exponential operator. SIAM J. Numer. Anal., 34(5):1911-1925, Oct. 1997. (Pubitemid 127463577)
13. G. Iyengar, D. J. Phillips, and C. Stein. Approximation algorithms for semidefinite packing problems with applications to maxcut and graph coloring. In IPCO'05: Proc. 11th Conf. Integer Programming and Combinatorial Optimization, pages 152-166, 2005.
14. G. Iyengar, D. J. Phillips, and C. Stein. Approximating semidefinite packing programs. SIAM Journal on Optimization, 21(1):231-268, 2011.
15. S. Kale. Efficient algorithms using the multiplicative weights update method. Technical report, Princeton University, Department of Computer Science, 2007.
16. R. Kannan, S. Vempala, and A. Vetta. On clusterings - good, bad and spectral. In FOCS'00: Proc. 41th Ann. IEEE Symp. Foundations of Computer Science, page 367. IEEE Computer Society, 2000.
17. R. Khandekar, S. Rao, and U. Vazirani. Graph partitioning using single commodity flows. In STOC '06: Proc. 38th Ann. ACM Symp. Theory of Computing, pages 385-390. ACM, 2006.
18. I. Koutis, G. L. Miller, and R. 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. IEEE Computer Society, 2010.
19. A. Madry. Fast approximation algorithms for cut-based problems in undirected graphs. In Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS '10, pages 245-254. IEEE Computer Society, 2010.
20. L. Orecchia, S. Sachdeva, and N. K. Vishnoi. Approximating the exponential, the lanczos method and an Õ (m)-time spectral algorithm for balanced separator. CoRR, abs/1111.1491, 2011.
21. L. Orecchia, L. J. Schulman, U. V. Vazirani, and N. K. Vishnoi. On partitioning graphs via single commodity flows. In STOC '08: Proc. 40th Ann. ACM Symp. Theory of Computing, pages 461-470, 2008.
22. L. Orecchia and N. K. Vishnoi. Towards an sdp-based approach to spectral methods: A nearly-linear-time algorithm for graph partitioning and decomposition. In SODA'11: Proc. 22nd Ann. ACM-SIAM Symp. Discrete Algorithms, pages 532-545, 2011.
23. V. Y. Pan and Z. Q. Chen. The complexity of the matrix eigenproblem. In Proceedings of the thirty-first annual ACM symposium on Theory of computing, STOC '99, pages 507-516. ACM, 1999.
24. E. Parzen. Stochastic Processes. Society for Industrial and Applied Mathematics, 1999.
25. H. Räcke. 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. ACM, 2008.
26. Y. Saad. Analysis of some Krylov subspace approximations to the matrix exponential operator. SIAM J. Numer. Anal., 29:209-228, February 1992.
27. E. Saff. On the degree of best rational approximation to the exponential function. Journal of Approximation Theory, 9(2):97-101, 1973.
28. -z by rational functions with real poles. Numerische Mathematik, 25:307-322, 1975.
29. K. Schloegel, G. Karypis, and V. Kumar. Sourcebook of parallel computing. chapter Graph partitioning for high-performance scientific simulations, pages 491-541. Morgan Kaufmann Publishers Inc., 2003.
30. J. Sherman. Breaking the multicommodity flow barrier for O (√log n)-approximations to sparsest cut. In FOCS'09: Proc. 50th Ann. IEEE Symp. Foundations of Computer Science, 2009.
31. J. Shewchuk. An introduction to the conjugate gradient method without the agonizing pain. 1994. http://www.cs.cmu.edu/~quake-papers/ painless-conjugate- gradient.pdf.
32. D. B. Shmoys. Approximation algorithms for NP-hard problems. chapter Cut problems and their application to divide-and-conquer, pages 192-235. PWS Publishing Co., 1997.
33. D. A. Spielman and S.-H. Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In STOC '04: Proc. 36th Ann. ACM Symp. Theory of Computing, pages 81-90. ACM, 2004.
34. D. A. Spielman and S.-H. Teng. Nearly-linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems. CoRR, abs/cs/0607105, 2006.
35. D. A. Spielman and S.-H. Teng. A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning. CoRR, abs/0809.3232, 2008.
36. C. Underhill and A. Wragg. Convergence properties of Padé approximants to exp(z) and their derivatives. IMA Journal of Applied Mathematics, 11(3):361-367, 1973.