License
When quoting this document, please refer to the following
DOI: 10.4230/DFU.Vol7.15301.179
URN: urn:nbn:de:0030-drops-69641
URL: http://drops.dagstuhl.de/opus/volltexte/2017/6964/
Go to the corresponding DFU Volume Portal


Gutin, Gregory ; Yeo, Anders

Parameterized Constraint Satisfaction Problems: a Survey

pdf-format:
DFU-Vol7-15301-7.pdf (0.6 MB)


Abstract

We consider constraint satisfaction problems parameterized above or below guaranteed values. One example is MaxSat parameterized above m/2: given a CNF formula F with m clauses, decide whether there is a truth assignment that satisfies at least m/2 + k clauses, where k is the parameter. Among other problems we deal with are MaxLin2-AA (given a system of linear equations over F_2 in which each equation has a positive integral weight, decide whether there is an assignment to the variables that satisfies equations of total weight at least W/2+k, where W is the total weight of all equations), Max-r-Lin2-AA (the same as MaxLin2-AA, but each equation has at most r variables, where r is a constant) and Max-r-Sat-AA (given a CNF formula F with m clauses in which each clause has at most r literals, decide whether there is a truth assignment satisfying at least sum_{i=1}^m (1-2^{r_i})+k clauses, where k is the parameter, r_i is the number of literals in clause i, and r is a constant). We also consider Max-r-CSP-AA, a natural generalization of both Max-r-Lin2-AA and Max-r-Sat-AA, order (or, permutation) constraint satisfaction problems parameterized above the average value and some other problems related to MaxSat. We discuss results, both polynomial kernels and parameterized algorithms, obtained for the problems mainly in the last few years as well as some open questions.

BibTeX - Entry

@InCollection{gutin_et_al:DFU:2017:6964,
  author =	{Gregory Gutin and Anders Yeo},
  title =	{{Parameterized Constraint Satisfaction Problems: a Survey}},
  booktitle =	{The Constraint Satisfaction Problem: Complexity and Approximability},
  pages =	{179--203},
  series =	{Dagstuhl Follow-Ups},
  ISBN =	{978-3-95977-003-3},
  ISSN =	{1868-8977},
  year =	{2017},
  volume =	{7},
  editor =	{Andrei Krokhin and Stanislav Zivny},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/6964},
  URN =		{urn:nbn:de:0030-drops-69641},
  doi =		{10.4230/DFU.Vol7.15301.179},
  annote =	{Keywords: Constraint satisfaction problems, Fixed-parameter tractability}
}

Keywords: Constraint satisfaction problems, Fixed-parameter tractability
Seminar: The Constraint Satisfaction Problem: Complexity and Approximability
Issue Date: 2017
Date of publication: 14.02.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI