Maximum constraint satisfaction on diamonds

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

Volumn 3709 LNCS, Issue , 2005, Pages 388-402

  Krokhin, Andrei ^a   Larose, Benoit ^b  

^a DURHAM UNIVERSITY   (United Kingdom)

^b Dept of Electrical and Computer Engineering   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; COMPUTER SYSTEMS PROGRAMMING; PROBLEM SOLVING; SET THEORY;

MAXIMUM CONSTRAINT SATISFACTION; OVERLAPPING SETS; TRACTABILITY; WEIGHTED MAXIMUM CONSTRAINT SATISFACTION PROBLEM (MAX CSP);

CONSTRAINT THEORY;

EID: 33646194615     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_30     Document Type: Conference Paper

References (22)

1. F. Börner, A. Bulatov, P. Jeavons, and A. Krokhin. Quantified constraints: Algorithms and complexity. In CSL'03, volume 2803 of LNCS, pages 58-70, 2003.
2. A. Bulatov. A dichotomy theorem for constraints on a 3-element set. In FOCS'02, pages 649-658, 2002.
3. A. Bulatov. Tractable conservative constraint satisfaction problems. In LICS'03, pages 321-330, 2003.
4. A. Bulatov and V. Dalmau. Towards a dichotomy theorem for the counting constraint satisfaction problem. In FOCS'03, pages 562-571, 2003.
5. R.E. Burkard, B. Klinz, and R. Rudolf. Perspectives of Monge properties in optimization. Discrete Applied Mathematics, 70:95-161, 1996.
6. D. Cohen, M. Cooper, and P. Jeavons. A complete characterization of complexity for Boolean constraint optimization problems. In CP'04, volume 3258 of LNCS, pages 212-226, 2004.
7. D. Cohen, M. Cooper, P. Jeavons, and A. Krokhin. Soft constraints: complexity and multimorphisms. In CP'03, volume 2833 of LNCS, pages 244-258, 2003.
8. D. Cohen, M. Cooper, P. Jeavons, and A. Krokhin. Identifying efficiently solvable cases of Max CSP. In STACS'04, volume 2996 of LNCS, pages 152-163, 2004.
9. N. Creignou. A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computer and System Sciences, 51:511-522, 1995.
10. N. Creignou, S. Khanna, and M. Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems, SIAM, 2001.
11. 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.
12. B.A. Davey and H.A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 2nd edition, 2002.
13. B.L. Dietrich and A.J. Hoffman. On greedy algorithms, partially ordered sets, and submodular functions. IBM J. of Research and Development, 47(1):25-30, 2003.
14. L. Engebretsen and V. Guruswami. Is constraint satisfaction over two variables always easy? Random Structures and Algorithms, 25(2): 150-178, 2004.
15. S. Fujishige. Submodular Functions and Optimization, North-Holland, 1991.
16. A. Goldberg and R.E. Tarjan. A new approach to the maximum flow problem. J. ACM, 35:921-940, 1988.
17. M. Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side. In FOCS'03, pages 552-561, 2003.
18. J. Håstad. Some optimal inapproximability results. J. ACM, 48:798-859, 2001.
19. S. Iwata, L. Fleischer, and S. Fujishige. A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM, 48(4):761-777, 2001.
20. P. Jonsson. Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights. Theoret. Comput. Sci., 244(1-2):189-203, 2000.
21. P. Jonsson, M. Klasson, and A. Krokhin. The approximability of three-valued Max CSP. Technical Report cs.CC/0412042, CoRR, 2004.
22. D. Topkis. Supermodularity and Complementarity. Princeton Univ. Press, 1998.