Max cut and the smallest eigenvalue

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 263-271

  Trevisan, Luca ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Maximum cut; Spectral partitioning

Indexed keywords

ADJACENCY MATRICES; APPROXIMATION RATIOS; APPROXIMATION RESULTS; BIPARTITION; E-FRACTIONS; LINEAR TIME; MAX CUT; MAXIMUM CUT; OPTIMAL SOLUTIONS; POLYNOMIAL-TIME ALGORITHMS; SMALLEST EIGENVALUE; SPECTRAL PARTITIONING;

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; EIGENVALUES AND EIGENFUNCTIONS; POLYNOMIAL APPROXIMATION;

GRAPH THEORY;

EID: 70350672579     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536452     Document Type: Conference Paper

References (26)

1. A. Agarwal, M. Charikar, K. Makarychev, and Y. Makarychev. O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. In Proceedings of the 37th ACM Symposium on Theory of Computing, pages 573-581, 2005.
2. N. Alon. Eigenvalues and expanders. Combinatorica, 6(2):83-96, 1986.
3. N. Alon and A. Naor. Approximating the cut-norm via Grothendieck's inequality. SIAM Journal on Computing, 35(4):787-803, 2006.
4. N. Alon and B. Sudakov. Bipartite subgraphs and the smallest eigenvalue. Combinatorics, Probability and Computing, 9:1-12, 2000.
5. S. Arora and S. Kale. A combinatorial, primal-dual approach to semidefinite programs. In Proceedings of the 39th ACM Symposium on Theory of Computing, pages 227-236, 2007.
6. S. Arora, S. Rao, and U. Vazirani. Expander flows and a √log n-approximation to sparsest cut. In Proceedings of the 36th ACM Symposium on Theory of Computing, 2004.
7. Y. Bilu and N. Linial. Lifts, discrepancy and nearly optimal spectral gap. Combinatorica, 26(5):495-519, 2006.
8. M. Charikar and A. Wirth. Maximizing quadratic programs: Extending Grothendieck's inequality. In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pages 54-60, 2004.
9. W. F. de la Vega and C. Kenyon-Mathieu. Linear programming relaxations of maxcut. In Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms, pages 53-61, 2007.
10. C. Delorme and S. Poljak. Combinatorial properties and the complexity of a max-cut approximation. European J. of Combinatorics, 14(4):313-333, 1993.
11. C. Delorme and S. Poljak. Laplacian eigenvalues and the maximum cut problem. Mathematical Programing, 62:557-574, 1993.
12. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42(6):1115-1145, 1995. Preliminary version in Proc. of STOC'94.
13. W. Haemers. Eigenvalue techniques in design and graph theory. PhD thesis, Eindhoven University of Technology, 1979.
14. R. Khandekar, S. Rao, and U. V. Vazirani. Graph partitioning using single commodity flows. In Proceedings of the 38th ACM Symposium on Theory of Computing, pages 385-390, 2006.
15. S. Khot. On the power of unique 2-prover 1-round games. In Proceedings of the 34th ACM Symposium on Theory of Computing, pages 767-775, 2002.
16. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for MAX-CUT and other two-variable CSPs? In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pages 146-154, 2004.
17. S. Khot and R. O'Donnell. SDP gaps and UGC-hardness for MAXCUTGAIN. In Proceedings of the 47th IEEE Symposium on Foundations of Computer Science, pages 217-226, 2006.
18. J. Kuczynski and H. Wozniakowski. Estimating the largest eigenvalues by the power and Lanczos algorithms with a random start. SIAM Journal on Matrix Analysis and Applications, 13:1094-1122, 1992.
19. L. Lovász. Semidefinite programs and combinatorial optimization. In B. Reed and C. Linhares-Sales, editors, Recent Advances in Algorithms and Combinatorics, pages 137-194. Springer, 2003.
20. E. Mossel, R. O'Donnell, and K. Oleszkiewicz. Noise stability of functions with low influences: invariance and optimality. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science, pages 21-30, 2005.
21. R. O.Donnell and Y. Wu. An optimal SDP algorithm for Max-Cut, and equally optimal long code tests. In Proceedings of the 40th ACM Symposium on Theory of Computing, 2008.
22. L. Orecchia, L. J. Schulman, U. V. Vazirani, and N. K. Vishnoi. On partitioning graphs via single commodity flows. In Proceedings of the 40th ACM Symposium on Theory of Computing, pages 461-470, 2008.
23. G. Ottaviano and L. Trevisan. An experimental analysis of a spectral approximation algorithm for MAX CUT. Preprint, 2008.
24. G. Schoenebeck, L. Trevisan, and M. Tulsiani. Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut. In Proceedings of the 39th ACM Symposium on Theory of Computing, pages 302-310, 2007.
25. D. Spielman and S.-H. Teng. Nearly linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the 36th ACM Symposium on Theory of Computing, pages 81-90, 2004.
26. L. Trevisan. Non-approximability results for optimization problems on bounded degree instances. In Proceedings of the 33rd ACM Symposium on Theory of Computing, pages 453-461, 2001.