Constraint Satisfaction Parameterized by Solution Size

@article{Bulatov2014ConstraintSP,
  title={Constraint Satisfaction Parameterized by Solution Size},
  author={Andrei A. Bulatov and D{\'a}niel Marx},
  journal={SIAM J. Comput.},
  year={2014},
  volume={43},
  pages={573-616}
}
In the constraint satisfaction problem (CSP) corresponding to a constraint language (i.e., a set of relations) $\Gamma$, the goal is to find an assignment of values to variables so that a given set of constraints specified by relations from $\Gamma$ is satisfied. The complexity of this problem has received a substantial amount of attention in the past decade. In this paper, we study the fixed-parameter tractability of CSPs parameterized by the size of the solution in the following sense: one of… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 15 CITATIONS

Algorithm Theory – SWAT 2012

VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials

VIEW 19 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Uniform CSP Parameterized by Solution Size is in W[1]

VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Parameterized Complexity of CSP for Infinite Constraint Languages

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A New Approximation Algorithm for Unsigned Translocation Sorting

VIEW 1 EXCERPT
CITES BACKGROUND

Fixed-parameter Approximability of Boolean MinCSPs

VIEW 2 EXCERPTS
CITES BACKGROUND