Bypassing UGC from some optimal geometric inapproximability results

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 699-717

  Guruswami, Venkatesan ^a   Raghavendra, Prasad ^b   Saket, Rishi ^c   Wu, Yi ^d  

^a Carnegie Mellon University   (United States)

^b Georgia Institute of Technology   (United States)

^c PRINCETON UNIVERSITY   (United States)

^d IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HARDNESS; LEAST SQUARES APPROXIMATIONS; NUMBER THEORY; OPTIMIZATION; POLYNOMIAL APPROXIMATION; RANDOM VARIABLES; RELAXATION PROCESSES;

GAUSSIAN RANDOM VARIABLE; GEOMETRIC PROBLEMS; LEAST SQUARES REGRESSION; MAXIMIZATION PROBLEM; NP-HARDNESS RESULTS; OPTIMAL INAPPROXIMABILITY; SUBSPACE APPROXIMATION; UNIQUE GAMES CONJECTURE;

APPROXIMATION ALGORITHMS;

EID: 84860115692     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.58     Document Type: Conference Paper

References (33)

1. N. Alon, K. Makarychev, Y. Makarychev, and A. Naor. Quadratic forms on graphs. In 37th ACM STOC, pages 486-493, 2005.
2. N. Alon and A. Naor. Approximating the cut-norm via Grothendieck's inequality. SIAM J. Comput., 35(4):787-803, 2006. (Pubitemid 44231256)
3. st IEEE FOCS, pages 563-572, 2010.
4. th IEEE FOCS, pages 206-215, 2005.
5. S. Arora, S. Khot, A. Kolla, D. Steurer, M. Tulsiani, and N. K. Vishnoi. Unique games on expanding constraint graphs are easy: extended abstract. In STOC, pages 21-28, 2008.
6. B. Barak, P. Raghavendra, and D. Steurer. Rounding semidefinite programming hierarchies via global correlation. In Proc. of 52nd FOCS, 2011 (to appear). Available at http://arxiv.org/abs/1104.4680.
7. A. Brieden, P. Gritzman, and V. Klee. Inapproximability of some geometric and quadratic optimization problems. In Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, 2000.
8. th IEEE FOCS, pages 54-60, 2004.
9. A. Deshpande, M. Tulsiani, and N. Vishnoi. Algorithms and hardness for subspace approximation. In Proc. SODA, 2011.
10. A. Deshpande and K. R. Varadarajan. Sampling-based dimension reduction for subspace approximation. In STOC, pages 641-650, 2007.
11. D. Feldman, M. Monemizadeh, C. Sohler, and D. P. Woodruff. Coresets and sketches for high dimensional subspace approximation problems. In SODA, pages 630-649, 2010.
12. th IEEE FOCS, pages 385-394, 2009.
13. G. Golub and C. van Loan. Matrix Computations. Johns Hopkins University Press, 1996.
14. th IEEE FOCS, pages 349-359, 2007.
15. V. Guruswami, J. Håstad, R. Manokaran, P. Raghavendra, and M. Charikar. Beating the random ordering is hard: Every ordering CSP is approximation resistant. SIAM J. Comput., 40(3):878-914, 2011.
16. V. Guruswami and A. K. Sinop. Lasserre hierarchy, higher eigenvalues, and approximation schemes for graph partitioning and quadratic integer programming with psd objectives. In Proc. of 52nd FOCS, 2011 (to appear). Available at http://arxiv.org/abs/1104.4746.
17. S. Har-Peled and K. R. Varadarajan. Projective clustering in high dimensions using core-sets. In Symposium on Computational Geometry, pages 312-318, 2002.
18. rd IEEE FOGS, pages 23-32, 2002.
19. th ACM STOC, pages 767-775, 2002.
20. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM J. Comput., 37(1):319-357, 2007. (Pubitemid 351321999)
21. S. Khot and O. Regev. Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci., 74(3):335-349, 2008.
22. S. Khot and R. Saket. A 3-query non-adaptive PCP with perfect completeness. In Proc. IEEE CCC, pages 159-169, 2006. (Pubitemid 46661588)
23. th ACM STOC, pages 345-354, 2008.
24. p Grothendieck problem. Math. Oper. Res., 35(2):267-283, 2010.
25. A. Megretski. Relaxations of quadratic programs in operator theory and system analysis. In Systems, approximation, singular integral operators, and related topics (Bordeaux), number 3, pages 365-392, 2001.
26. th IEEE FOCS, pages 156-165, 2008.
27. A. Naor and G. Schechtman. An approximation scheme for quadratic form maximization on convex bodies. Manuscript.
28. A. Nemirovski, C. Roos, and T. Terlaky. On maximization of quadratic form over intersection of ellipsoids with common center. Math. Program., 86(3, Ser. A):463-473, 1999.
29. Y. Nesetrov. Global quadratic optimization via conic relaxation. Working Paper CORE, 1998.
30. th ACM STOC, pages 245-254, 2008.
31. N. D. Shyamalkumar and K. R. Varadarajan. Efficient subspace approximation algorithms. In SODA, pages 532-540, 2007.
32. K. R. Varadarajan, S. Venkatesh, Y. Ye, and J. Zhang. Approximating the radii of point sets. SIAM J. Comput., 36(6):1764-1776, 2007.
33. th ACM-SIAM SODA, pages 201-210, 1998.