A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
[chapter]

2012
*
Lecture Notes in Computer Science
*

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 F2 in which each equation has a positive integral weight, decide whether there is an assignment to the variables that

doi:10.1007/978-3-642-30891-8_14
fatcat:r6ztg5kqybefhfxd2myyxtbq6q