On LP-based Approximability for strict CSPs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 1560-1573

  Kumar, Amit ^a   Manokaran, Rajsekar ^b   Tulsiani, Madhur ^c   Vishnoi, Nisheeth K ^d  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b Princeton University   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

^d MICROSOFT RESEARCH INDIA   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVES; COST FUNCTIONS; LINEAR PROGRAMMING;

COVERING AND PACKING; HYPERGRAPH VERTEX COVER; INAPPROXIMABILITY; ROUNDING ALGORITHM; SCHEDULING PROBLEM; SEMI-DEFINITE PROGRAM (SDP); STRICT CONSTRAINT; UNIQUE GAMES CONJECTURE;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 79955735596     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.121     Document Type: Conference Paper

References (28)

1. Ron Aharoni, Ron Holzman, and Michael Krivelevich. On a theorem of lovász on covers in tau-partite hypergraphs. Combinatorica, 16(2):149-174, 1996.
2. P. Austrin, S. Khot, and S. Safra. Inapproximability of vertex cover and independent set in bounded degree graphs. In Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009.
3. Nikhil Bansal and Subhash Khot. Inapproximability of hypergraph vertex cover and applications to scheduling problems. In Manuscript, 2009.
4. Nikhil Bansal and Subhash Khot. Optimal long code test with one free bit. In FOCS, pages 453-462, 2009.
5. J. Chuzhoy, S. Guha, E. Halperin, S. Khanna, G. Korsatz, and J. Naor. Asymmetic k-center is log* n hard to approximate. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004.
6. Irit Dinur, Venkatesan Guruswami, Subhash Khot, and Oded Regev. A new multilayered pep and the hardness of hypergraph vertex cover. In STOC, pages 595-601, 2003.
7. Irit Dinur and Shmuel Safra. The importance of being biased. In STOC, pages 33-42, 2002. (Pubitemid 35009358)
8. N. Garg and A. Kumar. Minimizing average flow-time: Upper and lower bounds. In Proceedings of the 48th Annual IEEE Symposium of Foundations of Computer Science, 2007.
9. V. Guruswami, R. Manokaran, and P. Raghavendra. Beating the random ordering is hard: Inapproximability of maximum acyclic subgraph. In 49th Annual IEEE Symposium on Foundations of Computer Science, 2008.
10. Oded Goldreich. Using the fglss-reduction to prove inapproximability results for minimum vertex cover in hypergraphs. Electronic Colloquium on Computational Complexity (ECCC), (102), 2001.
11. Venkatesan Guruswami and Rishi Saket. On the inapproximability of vertex cover on A:-partite A:-uniform hypergraphs. In Manuscript, 2010.
12. Johan Håstad. Some optimal inapproximability results. In STOC, pages 1-10, 1997.
13. E. Halperin and R. Krauthgainer. Polylogarithmic inapproximability. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003.
14. Jonas Holmerin. Improved inapproximability results for vertex cover on k-uniform hypergraphs. In ICALP, pages 1005-1016, 2002.
15. S. Khot. On the power of unique 2-prover 1-round games. In Proceedings of the 17th Annual IEEE Conference on Computational Complexity, page 25, 2002. (Pubitemid 34691889)
16. Subhash Khot. Inapproximability of np-complete problems, discrete fourier analysis, and geometry. In International Congress of Mathematics, 2010.
17. 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)
18. 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.
19. 1. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2005.
20. L. Lovasz. On minimax theorems of combinatorics, doctoral thesis. Mathematiki Lapok, 26:209-264, 1975.
21. R. Manokaran, J. Naor, P. Raghavendra, and R. Schwartz. SDP gaps and UGC hardness for multiway cut, 0-extension and metric labelling. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008.
22. E. Mossel. Gaussian bounds for noise correlation of functions and tight analysis of long codes. In Proceedings of the 49th Annual IEEE Conference on Foundations of Computer Science, pages 156-165, 2008.
23. Monaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, and Nelson A. Uhan. Minimizing the sum of weighted completion times in a concurrent open shop. In Manuscript, 2009.
24. P. Raghavendra. Optimal algorithms and inapproximability results for every csp? In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008.
25. P. Raghavendra and D. Steurer. Integrality gaps for strong sdp relaxations of unique games. In Proceedings of the 49th Annual Symposium on Foundations of Computer Science, 2009.
26. Prasad Raghavendra and David Steurer. How to round any csp. In FOCS, pages 586-594, 2009.
27. H. D. Sherali and W. P. Adams. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math., 3(3):411-430, 1990.
28. Luca Trevisan. Non-approximability results for optimization problems on bounded degree instances. In STOC, pages 453-461, 2001. (Pubitemid 32865760)