On the integrality ratio of semidefinite relaxations of MAX CUT

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 433-442

  Feige, U ^a   Schechtman, G ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; SET THEORY;

PROGRAMMING RELAXATIONS;

GRAPH THEORY;

EID: 0034832679     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380837     Document Type: Conference Paper

References (13)

1. Bipartite subgraphs and the smallest eigenvalue
2. Spherical rearrangements, subharmonic functions, and *-functions in n-space
3. Two point symmetrization, the isoperimetric inequality on the sphere and some applications
4. Approximating the value of two prover proof systems, with applications to max 2-sat and max dicut
5. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
6. Property testing and its connection to learning and approximation
7. Some optimal inapproximability results
8. Probability inequalities for sums of bounded random variables
9. How good is the goemans-williamson max cut algorithm?
10. Geometry of sets and measures in Euclidean spaces. Fractals and rectifiability
11. On the method of bounded differences
12. Concentration, results and applications