Tight bounds on the approximability of almost-satisfiable horn SAT and exact hitting set

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 1574-1589

  Guruswami, Venkatesan ^a   Zhou, Yuan ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; HARDNESS; LINEAR PROGRAMMING;

APPROXIMATION BOUNDS; BOOLEAN CONSTRAINT; INTEGRALITY GAPS; LINEAR PROGRAMMING RELAXATION; OPTIMAL INAPPROXIMABILITY; SATISFYING ASSIGNMENTS; SEMI-DEFINITE PROGRAMMING RELAXATIONS; UNIQUE GAMES CONJECTURE;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 79955713217     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.122     Document Type: Conference Paper

References (15)

1. Libor Barto and Marcin Kozik. Constraint satisfaction problems of bounded width. In Proceedings of the 50th IEEE Symposium on Foundations of Computer Science, pages 595-603, October 2009.
2. Moses Charikar, Konstantin Makarychev, and Yury Makarychev. Near-optimal algorithms for unique games. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pages 205-214, 2006. (Pubitemid 44306554)
3. Moses Charikar, Konstantin Makarychev, and Yury Makarychev. Near-optimal algorithms for maximum constraint satisfaction problems. ACM Transactions on Algorithms, 5(3), 2009.
4. Pierluigi Crescenzi, Riccardo Silvestri, and Luca Trevisan. On weighted vs unweighted versions of combinatorial optimization problems. Information and Computation, 167 (1):10-26, 2001.
5. Erik D. Demaine, Uriel Feige, Mohammad Taghi Hajiaghayi, and Mohammad R. Salavatipour. Combination can be hard: Approximability of the unique coverage problem. SIAM J. Comput., 38(4): 1464-1483, 2008.
6. Venkatesan Guruswami and Luca Trevisan. The complexity of making unique choices: Approximating 1-in- k sat. In Proceedings of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 99- 110, 2005. (Pubitemid 41480427)
7. Johan Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, 2001.
8. Pavol Hell and Jaroslav Nesetril. Colouring, constraint satisfaction, and complexity. Computer Science Review, 2(3):143-163, 2008.
9. Peter Jonsson, Andrei A. Krokhin, and Fredrik Kuivinen. Hard constraint satisfaction problems have hard gaps at location 1. Theor. Comput. Sci., 410 (38-40):3856-3874, 2009.
10. Subhash Khot. On the power of unique 2-prover 1-round games. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 767-775, 2002. (Pubitemid 35009440)
11. Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan O'Donnell. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM J. Comput., 37 (1):319-357, 2007. (Pubitemid 351321999)
12. Sanjeev Khanna, Madhu Sudan, Luca Trevisan, and David P. Williamson. The approximability of constraint satisfaction problems. SIAM J. Comput., 30(6): 1863-1920, 2000. (Pubitemid 34125441)
13. Prasad Raghavendra. Optimal algorithms and inapproximability results for every CSP? In Proceedings of the 40th ACM Symposium on Theory of Computing, pages 245-254, 2008.
14. T. J. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th ACM Symppsium on Theory of Computing, pages 216-226, 1978.
15. Uri Zwick. Finding almost-satisfying assignments. In Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, pages 551-560, 1998.