Expander flows, geometric embeddings and graph partitioning

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 222-231

  Arora, Sanjeev ^a   Rao, Satish ^b   Vazirani, Umesh ^b  

^a Princeton University   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation algorithms; Clustering; Conductance; Eigenvalues; Embedding; Expander; Graph partitioning; Normalized cuts; Semidefinite programming; Sparsest cuts; Spectral methods

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; EIGENVALUES AND EIGENFUNCTIONS; ELECTRIC CONDUCTANCE; GEOMETRY; GRAPH THEORY; SPECTRUM ANALYSIS;

APPROXIMATION ALGORITHMS; CLUSTERING; EMBEEDINGS; EXPANDER; GRAPH PARTITION; NORMALIZED CUTS; SEMIDEFINITE PROGRAMMING; SPARSEST CUTS;

COMPUTER PROGRAMMING;

EID: 4544250512     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007355     Document Type: Conference Paper

References (35)

1. F. Alizadeh. Interior point methods in semi- definite programming with applications to combinatorial optimization. SIAM J. Optimization, 5:13-51, 1995.
2. N. Alon. Eigenvalues and expanders. Combinatorica 6:83-96, 1986.
3. 1 isoperlmetric inequalities for graphs and superconcentrators. J. Combin. Theory B 38:73-88, 1985.
4. Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithms. SIAM J. Camp
5. K. Ball. An elementary introduction to modern convex geometry, In Flavors of Geometry, S. Levy (ed.), Cambridge University Press, 1997.
6. M. Blum, R. Karp, O. Vornberger, C. Papadirnitriou, M. Yannakakis. The complexity of tasting whether a graph is a superconcentrator, Inf. Proc. Letters 13:164-167, 1981.
7. J. Cheeger. A lower bound for the smallest eigenvalue of the Laplacian, in Problem in Analysis, 195-199, Princeton Univ. Press, (1970),
8. F. Chung. Spectral graph theory. CBMS Regional Conference Series in Mathematics, 92, American Mathematical Society, 1997.
9. L. Danzer and B. Grünbaum. On two problems of P. Erdos and V. L. Klee concerning convex bodies (in German). Math. Zeitschrift 79:95-99, 1962.
10. P. Diaconis and L. Saloff-Coste. Comparison theorems for reversible Markov chains. Annals of Applied Probavility 3:696-730, 1993.
11. U. Feige and R. Krauthgamer, A polylogarithmic approximation of the minimum bisection. In IEEE FOCS 2001 pp 105-115.
12. N. Garg and J. Köneman. Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems. In IEEE FOCS 1997.
13. N. Garg and V. V. Vazirani and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Computing, 25(2):235-251, 1996. Prelim. version in Proc. ACM STOC'93.
14. N. Garg and V. V. Vazirani and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Computing, 25(2):235-251, 1996. Prelim. version in Proc. ACM STOC'93.
15. M.X. Goemans. Semidefinite programming in combinatorial optimization. Math, Programming, 79:143-161, 1997.
16. M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. JACM, 42(6):1115-1145, 1995.
17. M. Grötschel, L. Lovász, and A. Schrijver. Geometric algorithms and combinatorial optimization. Springer-Verlag, 1993.
18. H. Karloff and U. Zwick. A 7/8-approximation algorithm for MAX 3SAT? Proc. of 38th IEEE FOCS (1997), 406-415.
19. D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. JACM, 45(2):246-265, 1998.
20. M. Jerrum and A. Sinclair. Approximating the permanent. SIAM J. Comput., 18(6):1149-1178, 1989.
21. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. JACM 46 1999. Prelim. version in ACM STOC 1988.
22. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. JACM 46 1999. Prelim. version in ACM STOC 1988.
23. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica 15:215-246, 1995.
24. L. Lovász. On the Shannon capacity of a graph, IEEE Trans. on Info. Theory IT-25:1-7, 1979.
25. A. Lubotzky, R. Philips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8:261-277, 1988.
26. J. Matousek. Lectures on Discrete Geometry. Springer Verlag, 2002.
27. Y. Nesterov and A. Nemirovskii. Interior point polynomial methods in convex programming. SIAM, Philadelphia, PA 1994.
28. S. Plotkin and D. B. Shmoys and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Math. Operations Res. 20:257-301. 1995. Prelim, version IEEE Foundations of Computer Science, 1991, 495-504.
29. S. Plotkin and D. B. Shmoys and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Math. Operations Res. 20:257-301. 1995. Prelim, version IEEE Foundations of Computer Science, 1991, 495-504.
30. G. Schechtman. Concentration, results and applications, Handbook of the Geometry of Banach Spaces, volume 2, W.B. Johnson and J. Lindenstrauss (eds.), North Holland, 2003. Draft version available from Schechtman's website.
31. F. Shahrokhi and D.W. Matula. The maximum concurrent flow problem. Journal of the ACM, 37:318-334, 1990.
32. D. S. Shmoys. Cut problems and their application to divide and conquer. Approximation Algorithms for NP-hard problems, D.S. Hochbaum (ed.), P'WS Publishing, 1995.
33. A. Sinclair. Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Prob., Comput. 1:351-370, 1992.
34. V. Vazirani. Approximation algorithms. Springer Verlag, 2002.
35. K. Zatloukal. Personal communication, November 2003.