Abstract
In this paper we study the complexity of the weighted maximum constraint satisfaction problem (Max CSP) over an arbitrary finite domain. In this problem, one is given a collection of weighted constraints on overlapping sets of variables, and the goal is to find an assignment of values to the variables so as to maximize the total weight of satisfied constraints. Max CSP is NP-hard in general; however, some restrictions on the form of constraints may ensure tractability. Recent results indicate that there is a connection between tractability of such restricted problems and supermodularity of the allowed constraint types with respect to some lattice ordering of the domain. We prove several results confirming this in a special case when the lattice ordering is as loose as possible, i.e., a diamond one.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Börner, F., Bulatov, A., Jeavons, P., Krokhin, A.: Quantified constraints: Algorithms and complexity. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 58–70. Springer, Heidelberg (2003)
Bulatov, A.: A dichotomy theorem for constraints on a 3-element set. In: FOCS 2002, pp. 649–658 (2002)
Bulatov, A.: Tractable conservative constraint satisfaction problems. In: LICS 2003, pp. 321–330 (2003)
Bulatov, A., Dalmau, V.: Towards a dichotomy theorem for the counting constraint satisfaction problem. In: FOCS 2003, pp. 562–571 (2003)
Burkard, R.E., Klinz, B., Rudolf, R.: Perspectives of Monge properties in optimization. Discrete Applied Mathematics 70, 95–161 (1996)
Cohen, D., Cooper, M., Jeavons, P.: A complete characterization of complexity for Boolean constraint optimization problems. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 212–226. Springer, Heidelberg (2004)
Cohen, D., Cooper, M., Jeavons, P., Krokhin, A.: Soft constraints: complexity and multimorphisms. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 244–258. Springer, Heidelberg (2003)
Cohen, D., Cooper, M., Jeavons, P., Krokhin, A.: Identifying efficiently solvable cases of Max CSP. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 152–163. Springer, Heidelberg (2004)
Creignou, N.: A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computer and System Sciences 51, 511–522 (1995)
Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM, Philadelphia (2001)
Datar, M., Feder, T., Gionis, A., Motwani, R., Panigrahy, R.: A combinatorial algorithm for MAX CSP. Information Processing Letters 85(6), 307–315 (2003)
Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)
Dietrich, B.L., Hoffman, A.J.: On greedy algorithms, partially ordered sets, and submodular functions. IBM J. of Research and Development 47(1), 25–30 (2003)
Engebretsen, L., Guruswami, V.: Is constraint satisfaction over two variables always easy? Random Structures and Algorithms 25(2), 150–178 (2004)
Fujishige, S.: Submodular Functions and Optimization. North-Holland, Amsterdam (1991)
Goldberg, A., Tarjan, R.E.: A new approach to the maximum flow problem. J. ACM 35, 921–940 (1988)
Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. In: FOCS 2003, pp. 552–561 (2003)
Håstad, J.: Some optimal inapproximability results. J. ACM 48, 798–859 (2001)
Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48(4), 761–777 (2001)
Jonsson, P.: Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights. Theoret. Comput. Sci. 244(1-2), 189–203 (2000)
Jonsson, P., Klasson, M., Krokhin, A.: The approximability of three-valued Max CSP. Technical Report cs.CC/0412042, CoRR (2004)
Topkis, D.: Supermodularity and Complementarity. Princeton Univ. Press, Princeton (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krokhin, A., Larose, B. (2005). Maximum Constraint Satisfaction on Diamonds. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_30
Download citation
DOI: https://doi.org/10.1007/11564751_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29238-8
Online ISBN: 978-3-540-32050-0
eBook Packages: Computer ScienceComputer Science (R0)