Approximating non-uniform sparsest cut via generalized spectra

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2013, Pages 295-305

  Guruswami, Venkatesan ^a   Sinop, Ali Kemal ^b  

^a Carnegie Mellon University ^*  (United States)

^b Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; LAPLACE TRANSFORMS;

COLUMN SELECTIONS; GENERALIZED EIGENVALUES; GENERALIZED SPECTRUM; HIGHER ORDER SPECTRUM; LAPLACIAN MATRICES; NORMALIZED LAPLACIAN; SEMIDEFINITE PROGRAMS; SMALLEST EIGENVALUE;

GRAPH THEORY;

EID: 84876022841     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973105.22     Document Type: Conference Paper

References (18)

1. R. Andersen and K. J. Lang. An algorithm for improving graph partitions. In SODA, pages 651-660, 2008.
2. S. Arora, B. Barak, and D. Steurer. Subexponential algorithms for Unique Games and related problems. In FOCS, pages 563-572, 2010.
3. S. Arora, J. Lee, and A. Naor. Euclidean distortion and the sparsest cut. J. American Mathematical Society, 21(1):1-21, 2008.
4. S. Arora, S. Rao, and U. V. Vazirani. Expander flows, geometric embeddings and graph partitioning. J. ACM, 56(2), 2009.
5. Y. Aumann and Y. Rabani. An o(log k) approximate Min-Cut Max-Flow theorem and approximation algorithm. SIAM J. Comput, 27(1):291-301, 1998. (Pubitemid 128596829)
6. B. Awerbuch and D. Peleg. Sparse partitions (extended abstract). In FOCS, pages 503-513, 1990.
7. S. N. Bhatt and F. T. Leighton. A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci., 28(2):300-343, 1984.
8. S. Chawla, A. Gupta, and H. Räcke. Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. ACM T. Algorithms, 4(2), 2008.
9. V. Guruswami and A. K. Sinop. Lasserre hierarchy, higher eigenvalues, and approximation schemes for graph partitioning and quadratic integer programming with PSD objectives. In FOCS, 2011.
10. V. Guruswami and A. K. Sinop. Faster SDP hierarchy solvers for local rounding algorithms. In FOCS, 2012. To appear.
11. V. Guruswami and A. K. Sinop. Optimal column-based low-rank matrix reconstruction. In SODA, 2012.
12. R. A. Horn and C. R. Johnson. Matrix analysis. Cambridge University Press, 1990.
13. A. Kolla. Spectral algorithms for unique games. In CCC, pages 122-130, 2010.
14. J. B. Lasserre. An explicit equivalent positive semidefinite program for nonlinear 0-1 programs. SIAM J. Optimization, 12(3):756-769, 2002.
15. F. T. Leighton and S. Rao. An approximate maxflow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In FOCS, pages 422-431, 1988.
16. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorial, 15(2):215-245, 1995.
17. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell., 22(8):888-905, 2000.
18. A. K. Sinop and L. Grady. Uninitialized, globally optimal, graph-based rectilinear shape segmentation: The Opposing Metrics method. In ICCV, pages 1-8, 2007.