Fast approximation algorithms for cut-based problems in undirected graphs

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2010, Pages 245-254

  Ma̧dry, Aleksander ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Balanced separator; Cut based problems; Fast approximation algorithms; Generalized sparsest cut; Graph decomposition; Graph partitioning

Indexed keywords

APPROXIMATION ALGORITHMS; FLOW GRAPHS; GRAPHIC METHODS; SEPARATORS; TREES (MATHEMATICS);

BALANCED SEPARATORS; CUT-BASED PROBLEMS; GRAPH DECOMPOSITIONS; GRAPH PARTITIONING; SPARSEST CUT;

GRAPH ALGORITHMS;

EID: 78751561518     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2010.30     Document Type: Conference Paper

References (28)

1. D. B. Shmoys, "Cut problems and their application to divide-and-conquer," in Approximation Algorithms for NP-hard Problems, D. Hochbaum, Ed., 1997, pp. 192-235.
2. J. Cheeger, "A lower bound for the smallest eigenvalue of the laplacian," in Problems in Analysis, eds Gunning RC, 1970.
3. 1, isoperimetric inequalities for graphs and superconcentrators," Journal of Combinatorial Theory, Series B, vol. 38, pp. 73-88, 1985.
4. J. Kuczyński and H. Woźniakowski, "Estimating the largest eigenvalues by the power and lanczos algorithms with a random start," SIAM J. Matrix Anal. Appl., vol. 13, no. 4, pp. 1094-1122, 1992.
5. D. A. Spielman and S.-H. Teng, "Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems," in STOC'04: Proceedings of the 36th Annual ACM Symposium on the Theory of Computing, 2004, pp. 81-90.
6. R. Andersen, F. Chung, and K. Lang, "Local graph partitioning using pagerank vectors," in FOCS'06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006, pp. 475-486.
7. R. Andersen and Y. Peres, "Finding sparse cuts locally using evolving sets," in STOC'09: Proceedings of the 41st Annual ACM symposium on Theory of Computing, 2009, pp. 235-244.
8. T. Leighton and S. Rao, "Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms," Journal of the ACM, vol. 46, no. 6, pp. 787-832, 1999.
9. S. Arora, S. Rao, and U. Vazirani, "Expander flows, geometric embeddings and graph partitioning," Journal of the ACM, vol. 56, no. 2, pp. 1-37, 2009.
10. S. Chawla, A. Gupta, and H. Rácke, "Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut," in SODA'05: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005, pp. 102-111.
11. S. Arora, J. R. Lee, and A. Naor, "Euclidean distortion and the sparsest cut," in STOC'05: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 553-562.
12. 2) time," in FOCS'04: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2004, pp. 238-247.
13. R. Khandekar, S. Rao, and U. Vazirani, "Graph partitioning using single commodity flows," in STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006, pp. 385-390.
14. 2) time," in STOC'96: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 47-55.
15. S. Arora and S. Kale, "A combinatorial, primal-dual approach to semidefinite programs," in STOC'07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007, pp. 227-236.
16. L. Orecchia, L. J. Schulman, U. V. Vazirani, and N. K. Vishnoi, "On partitioning graphs via single commodity flows," in STOC'08: Proceedings of the 40th Annual ACM Symposium on the Theory of Computing, 2008, pp. 461-470.
17. J. Sherman, "Breaking the multicommodity flow barrier for O(√logn)-approximations to sparsest cut," in FOCS'09: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009, pp. 363-372.
18. H. Räcke, "Optimal hierarchical decompositions for congestion minimization in networks," in STOC'08: Proceedings of the 40th Annual ACM Symposium on the Theory of Computing, 2008, pp. 255-264.
19. -, "Minimizing congestion in general networks," in FOCS'02: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 43-52.
20. Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Räcke, "Optimal oblivious routing in polynomial time," in STOC'03: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 383-388.
21. M. Bienkowski, M. Korzeniowski, and H. Räcke, "A practical algorithm for constructing oblivious routing schemes," in SPAA'03: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures, 2003, pp. 24-33.
22. C. Harrelson, K. Hildrum, and S. Rao, "A polynomialtime tree decomposition to minimize congestion," in SPAA'03: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures, 2003, pp. 34-43.
23. J. Fakcharoenphol, S. Rao, and K. Talwar, "A tight bound on approximating arbitrary metrics by tree metrics," in STOC'03: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 448-455.
24. I. Abraham, Y. Bartal, and O. Neiman, "Nearly tight low stretch spanning trees," in FOCS'08: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008, pp. 781-790, full version available at arXiv:0808.2017.
25. D. A. Spielman and S.-H. Teng, "Nearly-linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems," CoRR, vol. abs/cs/0607105, 2006.
26. A. V. Goldberg and S. Rao, "Beyond the flow decomposition barrier," Journal of the ACM, vol. 45, no. 5, pp. 783-797, 1998.
27. D. R. Karger, P. Klein, C. Stein, M. Thorup, and N. E. Young, "Rounding algorithms for a geometric embedding of minimum multiway cut," in STOC '99: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 668-678.
28. N. Garg, V. V. Vazirani, and M. Yannakakis, "Approximate max-flow min-(multi)cut theorems and their applications," SIAM Journal on Computing, vol. 25, no. 2, pp. 235-251, 1996.