On partitioning graphs via single commodity flows

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 461-470

  Orecchia, Lorenzo ^a   Schulman, Leonard J ^b   Vazirani, Umesh V ^a   Vishnoi, Nisheeth K ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c IBM RESEARCH INDIA   (India)

Author keywords

Edge separator; Graph partitioning; Matrix exponential; Single commmodity max fiow; Sparsest cut; Spectral method

Indexed keywords

APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY;

EDGE-SEPARATOR; GRAPH PARTITIONING; MATRIX EXPONENTIALS; SINGLE-COMMMODITY MAX-FIOW; SPARSEST CUT; SPECTRAL METHODS;

FLOW GRAPHS;

EID: 53349160038     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374442     Document Type: Conference Paper

References (13)

1. 2) time. Proceedings, IEEE Symposium on Foundations of Computer Science, 00:238-247, 2004.
2. S. Arora and S. Kale. A combinatorial, primal-dual approach to semidefinite programs. In STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 227-236, New York, NY, USA, 2007. ACM.
3. S. Arora, S. Rao, and U. Vazirani, Expander flows, geometric embeddings and graph partitioning. In STOC '04: Proceedings of the thirty-sixth annual ACM symposium on "Theory of computing, pages 222-231, New York, NY, USA, 2004. ACM.
4. R.. Bhatia. Matrix Analysis (Graduate Texts in Mathematics). Springer, 1996.
5. F. R. Chung. Spectral Graph Theory (CBMS Regional Conference Series in Mathematics, No. 92). American Mathematical Society, 1997.
6. N. R. Devanur, S. A. Khot, R. Saket, and N. K. Vishnoi. Integrality gaps for sparsest cut and minimum linear arrangement problems. In STOC '06: Proceedings of the thirty-eighth annual ACM symposium, on Theory of computing, pages 537-546, New York, NY, USA, 2006. ACM.
7. A. V. Goldberg and S. Rao. Beating the flow decomposition barrier. Journal of the ACM (JACM), 45:783-797, 1998.
8. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs SIAM Journal on Scientific Computing, 20:359-392, 1999.
9. R. Khandekar, S. Rao, and U. Vazirani. Graph partitioning using single commodity flows. In STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pages 385-390, New York, NY, USA, 2006. ACM.
10. R. M. Khandekar, S. Khot, L. Orecchia, and N. K. Vishnoi. On a cut-matching game for the sparsest cut problem. Technical Report EECS-2007-177, EECS Department, University of California, Berkeley, CA, 2007.
11. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM, 46(6):787-832, 1999.
12. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.
13. D. Shmoys. Cut problems and their application to divide and conquer. In D. Hochbaum, editor, Approximation algorithms for NP-hard problems, pages 192-235. PWS Publishing Co., Boston, MA, USA, 1996.