Maximizing quadratic programs: Extending Grothendieck's inequality

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

Volumn , Issue , 2004, Pages 54-60

  Charikar, Moses ^a   Wirth, Anthony ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCURACY ALGORITHMS; APPROXIMATION ALGORITHMS; CORRELATION CLUSTERING; GROTHENDIECK'S INEQUALITY;

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY VALUE PROBLEMS; CORRELATION METHODS; INTEGRAL EQUATIONS; MATRIX ALGEBRA; PROBLEM SOLVING; QUADRATIC PROGRAMMING; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

COMPUTER SCIENCE;

EID: 17744363129     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. N. Alon, K. Makarychev, Y. Makarychev, and A. Naor. Quadratic forms on graphs. Preprint.
2. N. Alon and A. Naor. Approximating the cut-norm via Grothendieck's inequality. In Proc. of 36th STOC, pages 72-80, 2004.
3. N. Bansal, A. Blum, and S. Chawla. Correlation clustering. In Proceedings of 43rd FOCS, pages 238-47, 2002.
4. N. Bansal, A. Blum, and S. Chawla. Correlation clustering. Machine Learning, 56:89-113, 2004.
5. M. Bellare and P. Rogaway. The complexity of approximating a nonlinear program. Journal of Mathematical Programming B, 69:429-41, 1995.
6. M. Charikar, V. Guruswami, and A. Wirth. Clustering with qualitative information. In Proc. of 44th FOCS, pages 524-33, 2003.
7. E. Demaine and N. Immorlica. Correlation clustering with partial information. In Proc. of 6th APPROX, pages 1-13, 2003.
8. D. Emanuel and A. Fiat. Correlation clustering-minimizing disagreements on arbitrary weighted graphs. In Proc. of 11th ESA, pages 208-20, 2003.
9. 2 rounding technique for semidefinite programs. In Proc. of 28th ICALP, pages 213-24, 2001.
10. M. Goemans and D. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite progamming. JACM, 42:1115-45, 1995.
11. A. Grothendieck. Résumé de la théorie métrique des produits tensoriels topologiques. Bol. Soc. Mat. Sao Paulo, 8:1-79, 1953.
12. J. Håstad. Some optimal inapproximability results. JACM, 48:798-859, 2001.
13. J. Håstad and S. Venkatesh. On the advantage over a random assignment. In Proc. of 34th STOC, pages 43-52, 2002.
14. J. Krivine. Sur la constante de Grothendieck. C. R. Acad. Sci. Paris Ser. A-B, 284:445-6, 1977.
15. A. Megretski. Relaxation of quadratic programs in operator theory and system analysis. In Systems, Approximation, Singular Integral Operators, and Related Topics (Bordeaux, 2000), pages 365-92. Birkhäuser, Basel, 2001.
16. Y. Nesterov. Semidefinite relaxation and nonconvex quadratic optimization. Optimization Methods and Software, 9:141-60, 1998.
17. E. Rietz. A proof of the Grothendieck inequality. Israel J. Math., 19:271-6, 1974.
18. C. Swamy. Correlation Clustering: Maximizing agreements via semidefinite programming. In Proc. of 15th SODA, pages 519-20, 2004.
19. L. Trevisan, G. Sorkin, M. Sudan, and D. Williamson. Gadgets, approximation, and linear programming. SIAM J. Comp., 29:2074-97, 2000.
20. U. Zwick. Outward rotations: A tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems. In Proc. of 31st STOC, pages 679-87, 1999.