Algorithmic extensions of Cheeger's inequality to higher eigenvalues and partitions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6845 LNCS, Issue , 2011, Pages 315-326

  Louis, Anand ^a   Raghavendra, Prasad ^a   Tetali, Prasad ^b   Vempala, Santosh ^a  

^a Georgia Institute of Technology   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENCY MATRICES; CHEEGER; HIGHER EIGENVALUES; LARGEST EIGENVALUES; SPARSEST CUT; VERTEX SET;

COMBINATORIAL OPTIMIZATION; EIGENVALUES AND EIGENFUNCTIONS; OPTIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 80052359435     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22935-0_27     Document Type: Conference Paper

References (13)

1. Arora, S., Barak, B., Steurer, D.: Subexponential algorithms for unique games and related problems. In: FOCS (2010)
2. Alon, N.: Eigenvalues and expanders. Combinatorica 6(2), 83-96 (1986)
3. Alon, N., Milman, V.D.: lambda1, isoperimetric inequalities for graphs, and superconcentrators. J. Comb. Theory, Ser. B 38(1), 73-88 (1985)
4. Arora, S., Rao, S., Vazirani, U.V.: Expander flows, geometric embeddings and graph partitioning. In: Babai, L. (ed.) STOC, pp. 222-231. ACM, New York (2004)
5. Borell, C.: Geometric bounds on the ornstein-uhlenbeck velocity process. Probability Theory and Related Fields 70, 1-13 (1985), doi:10.1007/BF00532234
6. Khandekar, R., Rao, S., Vazirani, U.V.: Graph partitioning using single commodity flows. In: Kleinberg, J.M. (ed.) STOC, pp. 385-390. ACM, New York (2006) (Pubitemid 44306573)
7. Kannan, R., Vempala, S., Vetta, A.: On clusterings: Good, bad and spectral. J. ACM 51(3), 497-515 (2004)
8. Leighton, F.T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6), 787-832 (1999)
9. Raghavendra, P., Steurer, D.: Graph expansion and the unique games conjecture. In: Schulman, L.J. (ed.) STOC, pp. 755-764. ACM, New York (2010)
10. Raghavendra, P., Steurer, D., Tetali, P.: Approximations for the isoperimetric and spectral profile of graphs and related parameters. In: STOC, pp. 631-640 (2010)
11. Raghavendra, P., Steurer, D., Tulsiani, M.: Reductions between expansion problems (2010) (manuscript)
12. Sherman, J.: Breaking the multicommodity flow barrier for O(√logn)-approximations to sparsest cut. In: FOCS, pp. 363-372, IEEE Computer Society, Los Alamitos (2009)
13. Steurer, D.: Personal communication (2010)