The UGC hardness threshold of the Lp grothendieck problem

Mathematics of Operations Research

Volumn 35, Issue 2, 2010, Pages 267-283

  Kindler, Guy ^a   Naor, Assaf ^b   Schechtman, Gideon ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b NEW YORK UNIVERSITY   (United States)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Approximation algorithms; Quadratic programming; Unique games hardness

Indexed keywords

BEST-KNOWN ALGORITHMS; CHARIKAR; COMPLETE GRAPHS; CORRELATION CLUSTERING; EIGEN-VALUE; GROTHENDIECK'S INEQUALITY; MAXIMUM CORRELATIONS; N-MATRIX; NP-HARD; OPERATOR THEORY; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; QUADRATIC FORM; QUADRATIC PROGRAMS; SINGULAR INTEGRAL OPERATORS; SYSTEM ANALYSIS; UNIQUE GAMES; UNIQUE GAMES CONJECTURE; UNIQUE GAMES HARDNESS; WALL POTENTIAL;

CLUSTERING ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; HARDNESS; NUMBER THEORY; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 77953100811     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1090.0425     Document Type: Article

References (36)

1. Achlioptas, D., A. Naor, Y. Peres. 2005. Rigorous location of phase transitions in hard optimization problems. Nature 435 759-764.
2. Alon, N., E. Berger. 2008. The Grothendieck constant of random and pseudo-random graphs. Discrete Optim. 5(2) 323-327.
3. Alon, N., A. Naor. 2006. Approximating the cut-norm via Grothendieck's inequality. SIAM J. Comput. 35(4) 787-803.
4. Alon, N., K. Makarychev, Y. Makarychev, A. Naor. 2006. Quadratic forms on graphs. Inventiones Math. 163(3) 499-522.
5. Arora, S., E. Berger, G. Kindler, E. Hazan, S. Safra. 2005. On non-approximability for quadratic programs. Proc. 46th Annual Sympos. Foundations Comput. Sci., IEEE Computer Society, 206-215.
6. Artin, E. 1964. The Gamma Function. Translated by Michael Butler. Athena Series: Selected Topics in Mathematics. Holt, Rinehart and Winston, New York.
7. Bachas, C. P. 1984. Computer-intractability of the frustration model of a spin glass. J. Phys. A: Math. General 17 709-712.
8. Bansal, N., A. Blum, S. Chawla. 2004. Correlation clustering. Machine Learning 56(1-3) 89-113.
9. Bansal, N., S. Bravyi, B. M. Terhal. 2009. Classical approximation schemes for the ground-state energy of quantum and classical lsingspin Hamiltonians on planar graphs. Quantum Inform. Comput. 9(7 and 8) 0701-0720.
10. Barahona, F. 1981. On the computational complexity of Ising spin glass models. J. Phys. A: Math. General 15 3241-3253.
11. Bellare, M., P. Rogaway. 1995. The complexity of approximating a nonlinear program. Math. Programming Ser. A 69(3) 429-441.
12. Ben Arous, G., A. Dembo, A. Guionnet. 2001. Aging of spherical spin glasses. Probab. Theory Related Fields 120(1) 1-67.
13. Bieche, L., R. Maynard, R. Rammal, J. P. Uhry. 1980. On the ground states of the frustration model of a spin glass by a matching method of graph theory. J. Phys. A: Math. General 13 2553-2576.
14. Brieden, A. 2002. Geometric optimization problems likely not contained in APX. Discrete Computational Geometry 28(2) 201-209.
15. Charikar, M., A. Wirth. 2004. Maximizing quadratic programs: Extending Grothendieck's inequality. Proc. 45th Annual Sympos. Foundations Comput. Sci., IEEE Computer Society, 54-60.
16. Charikar, M., K. Makarychev, Y. Makarychev. 2006. Near-optimal algorithms for unique games (extended abstract). Proc. 38th Annual ACM Sympos. Theory Comput., ACM, New York, 205-214.
17. de Klerk, E., M. Laurent, P. A. Parrilo. 2006. A PTASfor the minimization of polynomials of fixed degree over the simplex. Theoret. Comput. Sci. 361(2-3) 210-225.
18. Diestel, J., H. Jarchow, A. Tonge. 1995. Absolutely Summing Operators, Cambridge Studies in Advanced Mathematics, Vol.43. Cambridge University Press, Cambridge, MA.
19. Feige, U., M. Goemans. 1995. Approximating the value of two proper proof systems with applications to MAX-2SAT and MAX-DICUT. Proc. Third Israel Sympos. Theory Comput. Systems, Institute of Electrical and Electronics Engineers, Washington, DC, 182-189.
20. 2 rounding technique for semidefinite programs. J. Algorithms 60(1) 1-23.
21. Feige, U., L. Lovász. 1992. Two-prover one-round proof systems, their power and their problems. Proc. 24th Annual ACM Sympos. Theory Comput., ACM, New York, 733-744.
22. Goemans, M. X., D. P. Williamson. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42(6) 1115-1145.
23. Grötschel, M., L. Lovász, A. Schrijver. 1993. Geometric Algorithms and Combinatorial Optimization, Vol.2. Algorithms and Combinatorics, 2nd ed. Springer-Verlag, Berlin.
24. Hall, P. 1982. Rates of convergence in the central limit theorem. Research Notes in Mathematics, Vol.62. Pitman (Advanced Publishing Program), Boston.
25. Halperin, E., E. Hazan. 2006. HAPLOFREQ-Estimating haplotype frequencies efficiently. J. Comput. Biol. 13(2) 481-500.
26. Johnson, W. B., J. Lindenstrauss. 2001. Basic concepts in the geometry of Banach spaces. Handbook of the Geometry of Banach Spaces, Vol.I. North-Holland, Amsterdam, 1-84.
27. Karger, D., R. Motwani, M. Sudan. 1998. Approximate graph coloring by semidefinite programming. J. ACM 45(2) 246-265.
28. Khot, S. 2002. On the power of unique 2-prover 1-round games. Proc. Thirty-Fourth Annual ACM Sympos. Theory Comput., ACM, New York, 767-775. http://portal.acm.org/citation.cfm?id=510017. (Pubitemid 35009440)
29. Khot, S., R. O'Donnell. 2006. SDP gaps and UGC-hardness for MAXCUTGAIN. Proc. 47th Annual Sympos. Foundations Comput. Sci., IEEE Computer Society, 217-226.
30. Machta, J. 1993. The computational complexity of pattern formation. J. Statist. Phys. 70 949-966.
31. Megretski, A. 2001. Relaxations of quadratic programs in operator theory and system analysis. Systems, Approximation, Singular Integral Operators, and Related Topics (Bordeaux, 2000), Vol.129. Operator Theory Advances and Applications. Birkhauser, Basel, 365-392.
32. Nemirovski, A., C. Roos, T. Terlaky. 1999. On maximization of quadratic form over intersection of ellipsoids with common center. Math. Program. Ser. A 86(3) 463-473.
33. Nesterov, Y. 1998. Global quadratic optimization via conic relaxation. Working paper, CORE. http://www.core.ucl.ac.be/ services/psfiles/dp98/dp9860. pdf.
34. Sompolinsky, H., A. Zippelius. 1981. Dynamic theory of the spin-glass phase. Phys. Rev. Lett. 47(5) 359-362.
35. van Beek, P. 1972. An application of Fourier methods to the problem of sharpening the Berry-Esseen inequality. Z. Wahrscheinlichkeit-stheorie Verw. Gebiete 23 187-196.
36. Wolfram, S. 1985. Undecidability and intractability in theoretical physics. Phys. Rev. Lett. 54 735-738.