The Internet Archive has a preservation copy of this work in our general collections.
The file type is `application/pdf`

.

##
###
Constraint Satisfaction Problems Parameterized Above or Below Tight Bounds: A Survey
[article]

2011
*
arXiv
*
pre-print

We consider constraint satisfaction problems parameterized above or below tight bounds. 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

arXiv:1108.4803v1
fatcat:3wxkx7blgjfkzmqtw4jn7qdlqa