Identifying efficiently solvable cases of Max CSP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2996, Issue , 2004, Pages 152-163

  Cohen, David ^a   Cooper, Martin ^b   Jeavons, Peter ^c   Krokhin, Andrei ^d  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b IRIT   (France)

^c UNIVERSITY OF OXFORD   (United Kingdom)

^d UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; POLYNOMIAL APPROXIMATION;

CONSTRAINT TYPES; EQUALITY CONSTRAINTS; MAXIMIZATION PROBLEM; MAXIMUM CONSTRAINT SATISFACTION PROBLEMS; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME; SUBMODULAR FUNCTION MINIMIZATION; SUPERMODULAR FUNCTIONS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 33646190489     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24749-4_14     Document Type: Article

References (28)

1. G. Ausiello, P. Creszenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Springer, 1999.
2. F. Börner, A. Bulatov, P. Jeavons, and A. Krokhin. Quantified constraints: Algorithms and complexity. In Proceedings of CSL '03, volume 2803 of LNCS, pages 58-70, 2003.
3. A. Bulatov. A dichotomy theorem for constraints on a three-element set. In Proceedings of FOCS'02, pages 649-658, 2002.
4. A. Bulatov. Tractable conservative constraint satisfaction problems. In Proceedings of LICS'03, pages 321-330, 2003.
5. A. Bulatov and V. Dalmau. Towards a dichotomy theorem for the counting constraint satisfaction problem. In Proceedings of FOCS'03, pages 562-571, 2003.
6. R.E. Burkard, B. Klinz, and R. Rudolf. Perspectives of Monge properties in optimization. Discrete Applied Mathematics, 70:95-161, 1996.
7. N. Creignou, S. Khanna, and M. Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems, volume 7 of SIAM Monographs on Discrete Mathematics and Applications. 2001.
8. E. Dahlhaus, D.S. Johnson, C.H. Papadimitriou, P.D. Seymour, and M. Yannakakis. The complexity of multiterminal cuts. SIAM Journal on Computing, 23(4):864-894, 1994.
9. M. Datar, T. Feder, A. Gionis, R. Motwani, and R. Panigrahy. A combinatorial algorithm for MAX CSP. Information Processing Letters, 85(6):307-315, 2003.
10. B.A. Davey and H.A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.
11. L. Engebretsen and V. Guruswami. Is constraint satisfaction over two variables always easy? In Proceedings of RANDOM'02, volume 2483 of LNCS, pages 224-238, 2002.
12. T. Feder and M.Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing, 28:57-104, 1998.
13. S. Fujishige. Submodular Functions and Optimization, volume 47 of Annals of Discrete Mathematics. North-Holland, Amsterdam, 1991.
14. M.X. Goemans and V.S. Ramakrishnan. Minimizing submodular functions over families of subsets. Combinatorica, 15:499-513, 1995.
15. A. Goldberg and R.E. Tarjan. A new approach to the maximum flow problem. Journal of the ACM, 35:921-940, 1988.
16. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, New York, 1988.
17. J. Håstad. Some optimal inapproximability results. Journal of the ACM, 48:798-859, 2001.
18. S. Iwata, L. Fleischer, and S. Fujishige. A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM, 48(4):761-777, 2001.
19. P. Jeavons. On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200:185-204, 1998.
20. P. Jonsson. Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights. Theoretical Computer Science, 244(1-2):189-203, 2000.
21. H. Narayanan. Submodular Functions and Electrical Networks. North-Holland, 1997.
22. G.L. Nemhauser and L.A. Wolsey. Integer and Combinatorial Optimization. Wiley, 1988.
23. C.H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43(3):425-440, 1991.
24. R. Rudolf. Recognition of d-dimensional Monge arrays. Discrete Applied Mathematics, 52(1):71-82, 1994.
25. T.J. Schaefer. The complexity of satisfiability problems. In Proceedings STOC'78, pages 216-226, 1978.
26. A. Schrijver. A combinatorial algorithm minimizing submodular functions in polynomial time. Journal of Combinatorial Theory, Ser.B, 80:346-355, 2000.
27. A. Shioura. Minimization of an M-convex function. Discrete Applied Mathematics, 84:215-220, 1998.
28. D. Topkis. Supermodularity and Complementarity. Princeton University Press, 1998.