The positive semidefinite grothendieck problem with rank constraint

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6198 LNCS, Issue PART 1, 2010, Pages 31-42

  Briët, Jop ^a   De Oliveira Filho, Fernando Mário ^b   Vallentin, Frank ^c  

^a CWI   (Netherlands)

^b TILBURG UNIVERSITY   (Netherlands)

^c DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; EDGE WEIGHTS; LAPLACIAN MATRICES; POLYNOMIAL-TIME ALGORITHMS; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS; POSITIVE INTEGERS; POSITIVE SEMIDEFINITE MATRICES; RANK CONSTRAINTS; UNIQUE GAMES CONJECTURE; WEIGHTED GRAPH;

LINGUISTICS; POLYNOMIAL APPROXIMATION; TRANSLATION (LANGUAGES);

APPROXIMATION ALGORITHMS;

EID: 77955320189     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14165-2_4     Document Type: Conference Paper

References (22)

1. Andrews, G. E., Askey, R., Roy, R.: Special functions. Cambridge University Press, Cambridge (1999)
2. Alon, N., Makarychev, K., Makarychev, Y., Naor, A.: Quadratic forms on graphs. Invent. Math. 163, 499-522 (2006)
3. Alon, N., Naor, A.: Approximating the cut-norm via Grothendieck's inequality. SIAM J. Comp. 35, 787-803 (2006)
4. Ben-Tal, A., Nemirovski, A.: On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty. SIAM J. Optim. 12, 811-833 (2002)
5. Briët, J., Buhrman, H., Toner, B.: A generalized Grothendieck inequality and entanglement in XOR games (January 2009) (preprint)
6. Goemans, M. X., Williamson, D. P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115-1145 (1995)
7. Grothendieck, A.: Résumé de la théorie métrique des produits tensoriels topologiques. Bol. Soc. Mat. São Paulo 8, 1-79 (1953)
8. Jameson, G. J. O.: Summing and nuclear norms in Banach space theory. Cambridge University Press, Cambridge (1987)
9. Karakostas, G.: A better approximation ratio for the vertex cover problem. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, pp. 1043-1050. Springer, Heidelberg (2005)
10. Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 767-775 (2002)
11. Khot, S., Kindler, G., Mossel, E., O'Donnell, R.: Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM J. Comput. 37, 319-357 (2007)
12. Khot, S., Naor, A.: Approximate kernel clustering. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 561-570. IEEE Computer Society, Los Alamitos (2008)
13. Khot, S., Naor, A.: Sharp kernel clustering algorithms and their associated Grothendieck inequalities, preprint (June 2009)
14. Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-ε. In: Proceedings of the 18th Annual IEEE Conference on Computational Complexity, pp. 379-386. IEEE Computer Society, Los Alamitos (2003)
15. Linial, N., Shraibman, A.: Lower bounds in communication complexity based on factorization norms. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp. 699-708 (2007)
16. Mahajan, S., Ramesh, H.: Derandomizing approximation algorithms based on semidefinite programming
17. Muirhead, R. J.: Aspects of multivariate statistical theory. John Wiley & Sons, Chichester (1982)
18. Nesterov, Y. E.: Semidefinite relaxation and nonconvex quadratic optimization. Optimization Methods and Software 9, 141-160 (1998)
19. Raghavendra, P.: Optimal algorithms and inapproximability results for every csp? In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 245-254 (2008)
20. Raghavendra, P., Steurer, D.: Towards computing the Grothendieck constant. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 525-534 (2009)
21. Rietz, R. E.: A proof of the Grothendieck inequality. Israel J. Math. 19, 271-276 (1974)
22. Schoenberg, I. J.: Positive definite functions on spheres. Duke Math. J. 9, 96-108 (1942)