Abstract
In this paper we study the complexity of the maximum constraint satisfaction problem (Max CSP) over an arbitrary finite domain. We describe a novel connection between this problem and the supermodular function maximization problem (which is dual to the submodular function minimization problem). Using this connection, we are able to identify large classes of efficiently solvable subproblems of Max CSP arising from certain restrictions on the constraint types. Until now, the only known polynomial-time solvable cases for this form of optimization problem were restricted to constraints over a 2-valued (Boolean) domain. Here we obtain the first examples of general families of efficiently solvable cases of Max CSP for arbitrary finite domains, by considering supermodular functions on finite lattices. Finally, we show that the equality constraint over a non-Boolean domain is non-supermodular, and, when combined with some simple unary constraints, gives rise to cases of Max CSP which are hard even to approximate.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Ausiello, G., Creszenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (1999)
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 three-element set. In: Proceedings of FOCS 2002, pp. 649–658 (2002)
Bulatov, A.: Tractable conservative constraint satisfaction problems. In: Proceedings of LICS 2003, pp. 321–330 (2003)
Bulatov, A., Dalmau, V.: Towards a dichotomy theorem for the counting constraint satisfaction problem. In: Proceedings of 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)
Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications, vol. 7 (2001)
Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM Journal on Computing 23(4), 864–894 (1994)
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. Cambridge University Press, Cambridge (1990)
Engebretsen, L., Guruswami, V.: Is constraint satisfaction over two variables always easy? In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol. 2483, pp. 224–238. Springer, Heidelberg (2002)
Feder, T., Vardi, M.Y.: 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)
Fujishige, S.: Submodular Functions and Optimization. Annals of Discrete Mathematics, vol. 47. North-Holland, Amsterdam (1991)
Goemans, M.X., Ramakrishnan, V.S.: Minimizing submodular functions over families of subsets. Combinatorica 15, 499–513 (1995)
Goldberg, A., Tarjan, R.E.: A new approach to the maximum flow problem. Journal of the ACM 35, 921–940 (1988)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, New York (1988)
Håstad, J.: Some optimal inapproximability results. Journal of the ACM 48, 798–859 (2001)
Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM 48(4), 761–777 (2001)
Jeavons, P.: On the algebraic structure of combinatorial problems. Theoretical Computer Science 200, 185–204 (1998)
Jonsson, P.: Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights. Theoretical Computer Science 244(1-2), 189–203 (2000)
Narayanan, H.: Submodular Functions and Electrical Networks. North-Holland, Amsterdam (1997)
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, Chichester (1988)
Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43(3), 425–440 (1991)
Rudolf, R.: Recognition of d-dimensional Monge arrays. Discrete Applied Mathematics 52(1), 71–82 (1994)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings STOC 1978, pp. 216–226 (1978)
Schrijver, A.: A combinatorial algorithm minimizing submodular functions in polynomial time. Journal of Combinatorial Theory, Ser. B 80, 346–355 (2000)
Shioura, A.: Minimization of an M-convex function. Discrete Applied Mathematics 84, 215–220 (1998)
Topkis, D.: Supermodularity and Complementarity. Princeton University Press, Princeton (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cohen, D., Cooper, M., Jeavons, P., Krokhin, A. (2004). Identifying Efficiently Solvable Cases of Max CSP. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-24749-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21236-2
Online ISBN: 978-3-540-24749-4
eBook Packages: Springer Book Archive