Linear programming, width-1 CSPs, and robust satisfaction

ITCS 2012 - Innovations in Theoretical Computer Science Conference

Volumn , Issue , 2012, Pages 484-495

  Kun, Gabor ^a   O'Donnell, Ryan ^b   Tamaki, Suguru ^c   Yoshida, Yuichi ^c   Zhou, Yuan ^b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b Carnegie Mellon University   (United States)

^c KYOTO UNIVERSITY   (Japan)

Author keywords

approximation algorithm; constraint satisfaction problems; linear programming; robust satisfaction algorithm; width 1 CSPs

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; LINEAR PROGRAMMING RELAXATION; WIDTH-1 CSPS;

APPROXIMATION ALGORITHMS; CONSTRAINT THEORY; INNOVATION; LINEAR PROGRAMMING;

COMPUTER PROGRAMMING;

EID: 84863073195     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2090236.2090274     Document Type: Conference Paper

References (22)

1. Andrei Bulatov, Peter Jeavons, and Andrei Krokhin. Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing, 34(3):720-742, 2005. 1
2. Libor Barto and Marcin Kozik. Constraint satisfaction problems of bounded width. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, volume 9, pages 595-603, 2009. 1, 2.3
3. Andrei Bulatov. Combinatorial problems raised from 2-semilattices. Journal of Algebra, 298(2):321-339, 2006. B.2, 21
4. Andrei Bulatov. Bounded relational width. Available at http://www.cs.sfu.ca/~abulatov/mpapers.html, 2009. 1, 2.3
5. Catarina Carvalho, Víctor Dalmau, and Andrei Krokhin. Two new homomorphism dualities and lattice operations. Journal of Logic and Computation, 2010. 3.1
6. 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. 1
7. Moses Charikar, Konstantin Makarychev, and Yury Makarychev. Note on MAX 2SAT. In Electronic Colloquium on Computational Complexity TR06-064, 2006. 1
8. Víctor Dalmau and Justin Pearson. Closure functions and width 1 problems. In Proceedings of the 5th Annual Principles and Practice of Constraint Programming, pages 159-173, 1999. 1.1, 1.1, 2.3
9. Tomás Feder and Moshe Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing, 28(1):57-104, 1998. 1, 1.1, 1.1, 2.1, 2.1, 2.3
10. Michel Goemans and David Williamson. Improved approximation algorithms for maximum cut and satisability problems using semide finite programming. Journal of the ACM, 42:1115-1145, 1995. 1
11. Venkatesan Guruswami and Yuan Zhou. Tight bounds on the approximability of almost-satisfiable Horn SAT and Exact Hitting Set. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1574-1589, 2011. 1, 1, 1.1, 3.1
12. Johan Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, 2001. 1
13. Peter Jeavons, David Cohen, and Marc Gyssens. Closure properties of constraints. Journal of the ACM, 44(4):527-548, 1997. 1, 2.3
14. Peter Jonsson, Andrei Krokhin, and Fredrik Kuivinen. Hard constraint satisfaction problems have hard gaps at location 1. Theoretical Computer Science, 410(38-40):3856-3874, 2009. 1
15. David Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9(3):256-278, 1974. 1
16. Subhash Khot. On the power of unique 2-prover 1-round games. In Proc. 34th ACM Symposium on Theory of Computing, pages 767-775, 2002. 1, 1
17. Gábor Kun and Mario Szegedy. A new line of attack on the Dichotomy Conjecture. In Electronic Colloquium on Computational Complexity TR09-059, 2009. 1, 2
18. Sanjeev Khanna, Madhu Sudan, Luca Trevisan, and David Williamson. The approximability of constraint satisfaction problems. SIAM Journal on Computing, 30(6):1863-1920, 2000. 3.1
19. Alan Mackworth. Consistency in networks of relations. Artificial intelligence, 8(1):99-118, 1977. 1.1
20. Prasad Raghavendra. Optimal algorithms and inapproximability results for every CSP? In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pages 245-254, 2008. 1, 1.1
21. Yuichi Yoshida. Optimal constant-time approximation algorithms and (unconditional)inapproximability results for every bounded-degree CSP. In Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, pages 665-674, 2011. 17
22. Uri Zwick. Finding almost-satisfying assignments. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 551-560, 1998. 1, 1.1