Abstract
In the constraint satisfaction problem (CSP) corresponding to a constraint language (i.e., a set of relations) Γ, the goal is to find an assignment of values to variables so that a given set of constraints specified by relations from Γ is satisfied. In this paper we study the fixed-parameter tractability of constraint satisfaction problems parameterized by the size of the solution in the following sense: one of the possible values, say 0, is “free,” and the number of variables allowed to take other, “expensive,” values is restricted. A size constraint requires that exactly k variables take nonzero values. We also study a more refined version of this restriction: a global cardinality constraint prescribes how many variables have to be assigned each particular value. We study the parameterized complexity of these types of CSPs where the parameter is the required number k of nonzero variables. As special cases, we can obtain natural and well-studied parameterized problems such as Independent set, Vertex Cover, d -Hitting Set, Biclique, etc. In the case of constraint languages closed under substitution of constants, we give a complete characterization of the fixed-parameter tractable cases of CSPs with size constraints, and we show that all the remaining problems are W[1]-hard. For CSPs with cardinality constraints, we obtain a similar classification, but for some of the problems we are only able to show that they are Biclique-hard. The exact parameterized complexity of the Biclique problem is a notorious open problem, although it is believed to be W[1]-hard.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bessière, C., Hebrard, E., Hnich, B., Walsh, T.: The complexity of global constraints. In: Wallace, M. (ed.) AAAI. LNCS, vol. 3258, pp. 112–117. Springer, Heidelberg (2004)
Bulatov, A.: Tractable conservative constraint satisfaction problems. In: LICS, pp. 321–330. IEEE Computer Society, Los Alamitos (2003)
Bulatov, A.A., Jeavons, P., Krokhin, A.A.: Classifying the complexity of constraints using finite algebras. SIAM J. Comput. 34(3), 720–742 (2005)
Bulatov, A.A., Marx, D.: The complexity of global cardinality constraints. In: LICS, pp. 419–428. IEEE Computer Society, Los Alamitos (2009)
Creignou, N., Schnoor, H., Schnoor, I.: Non-uniform boolean constraint satisfaction problems with cardinality constraint. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 109–123. Springer, Heidelberg (2008)
Downey, R.G., Fellows, M.R.: Parameterized Complexity (1999)
Feder, T., Vardi, M.Y.: Monotone monadic snp and constraint satisfaction. In: STOC, pp. 612–622 (1993)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)
Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. J. ACM 44, 527–548 (1997)
Jeavons, P., Cohen, D., Gyssens, M.: How to determine the expressive power of constraints. Constraints 4, 113–131 (1999)
Khanna, S., Sudan, M., Trevisan, L., Williamson, D.P.: The approximability of constraint satisfaction problems. SIAM J. Comput. 30(6), 1863–1920 (2001)
Kratsch, S., Wahlström, M.: Preprocessing of min ones problems: A dichotomy. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 653–665. Springer, Heidelberg (2010)
Krokhin, A.A., Marx, D.: On the hardness of losing weight. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 662–673. Springer, Heidelberg (2008)
Marx, D.: Parameterized complexity of constraint satisfaction problems. Computational Complexity 14
Régin, J.C., Gomes, C.P.: The cardinality matrix constraint. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 572–587. Springer, Heidelberg (2004)
Rosenberg, I.: Multiple-valued hyperstructures. In: ISMVL, pp. 326–333 (1998)
Schaefer, T.J.: The complexity of satisfiability problems. In: STOC, pp. 216–226 (1978)
Szeider, S.: The parameterized complexity of k-flip local search for sat and max sat. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 276–283. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bulatov, A.A., Marx, D. (2011). Constraint Satisfaction Parameterized by Solution Size. In: Aceto, L., Henzinger, M., Sgall, J. (eds) Automata, Languages and Programming. ICALP 2011. Lecture Notes in Computer Science, vol 6755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22006-7_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-22006-7_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22005-0
Online ISBN: 978-3-642-22006-7
eBook Packages: Computer ScienceComputer Science (R0)