Finding small sparse cuts by random walk

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

Volumn 7408 LNCS, Issue , 2012, Pages 615-626

  Kwok, Tsz Chiu ^a   Lau, Lap Chi ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

BICRITERIA APPROXIMATION; GRAPH PARTITIONING ALGORITHMS; POLYNOMIAL-TIME ALGORITHMS; RANDOM WALK; RUNNING TIME; SPARSEST CUT; UNDIRECTED GRAPH;

COMBINATORIAL OPTIMIZATION; GRAPH THEORY; POLYNOMIAL APPROXIMATION; RANDOM PROCESSES;

APPROXIMATION ALGORITHMS;

EID: 84865304942     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32512-0_52     Document Type: Conference Paper

References (20)

1. Alon, N., Milman, V.: Isoperimetric inequalities for graphs, and superconcentrators. Journal of Combinatorial Theory, Series B 38(1), 73-88 (1985)
2. Anderson, R., Chung, F.R.K., Lang, K.J.: Local graph partitioning using PageRank vectors. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 475-486 (2006)
3. Anderson, R., Peres, Y.: Finding sparse cuts locally using evolving sets. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), pp. 235-244 (2009)
4. Arora, S., Barak, B., Steurer, D.: Subexponential algorithms for unique games and related problems. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 563-572 (2010)
5. Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 222-231 (2004)
6. Bansal, N., Feige, U., Krauthgamer, R., Makarychev, K., Nagarajan, V., Naor, J., Schwartz, R.: Min-max graph partitioning and small set expansion. In: Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 17-26 (2011)
7. Cheeger, J.: A lower bound for the smallest eigenvalue of the Laplacian. In: Problems in Analysis, pp. 195-199. Princeton University Press (1970)
8. Chung, F.: A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank. In: Avrachenkov, K., Donato, D., Litvak, N. (eds.) WAW 2009. LNCS, vol. 5427, pp. 62-75. Springer, Heidelberg (2009)
9. Horry, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bulletin of the American Mathematical Society 43(4), 439-561 (2006)
10. Lee, J.R., Oveis Gharan, S., Trevisan, L.: Multi-way spectral partitioning and higher-order Cheeger inequalities. In: Proceedings of the 44th Annual Symposium on Theory of Computing (STOC), pp. 1117-1130 (2012)
11. Leighton, F.T., Rao, S.: Multicommodity max-flow min-cut theorem and their use in designing approximation algorithms. Journal of the ACM 46(6), 787-832 (1999)
12. Louis, A., Raghavendra, P., Tetali, P., Vempala, S.: Many sparse cuts via higher eigenvalues. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC), pp. 1131-1140 (2012)
13. Lovász, L., Kannan, R.: Faster mixing via average conductance. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), pp. 282-287 (1999)
14. Lovász, L., Simonovits, M.: The mixing time of Markov chains, an isoperimetric inequality, and computing the volume. In: Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 346-354 (1990)
15. Raghavendra, P., Steurer, D.: Graph expansion and the unique games conjecture. In: Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC), pp. 755-764 (2010)
16. Raghavendra, P., Steurer, D., Tetali, P.: Approximations for the isoperimetric and spectral profile of graphs and related parameters. In: Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC), pp. 631-640 (2010)
17. Raghavendra, P., Steurer, D., Tulsiani, M.: Reductions between expansion problems. In: Proceedings of the 27th Annual IEEE Conference on Computational Complexity, CCC (2012)
18. Spielman, D.A., Teng, S.-H.: A local clustering algorithm for massive graphs and its applications to nearly-linear time graph partitioning. CoRR, abs/0809.3232 (2008)
19. Orecchia, L., Sachdeva, S., Vishnoi, N.K.: Approximating the exponential, the Lanczos method, and an Õ(m)-time spectral algorithm for balanced separator. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC), pp. 1141-1160 (2012)
20. Oveis Gharan, S., Trevisan, L.: Approximating the expansion profile and almost optimal local graph clustering. CoRR, abs/1204.2021 (2012)