A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Fixed-parameter Approximability of Boolean MinCSPs
[article]
2018
arXiv
pre-print
The minimum unsatisfiability version of a constraint satisfaction problem (MinCSP) asks for an assignment where the number of unsatisfied constraints is minimum possible, or equivalently, asks for a minimum-size set of constraints whose deletion makes the instance satisfiable. For a finite set Γ of constraints, we denote by MinCSP(Γ) the restriction of the problem where each constraint is from Γ. The polynomial-time solvability and the polynomial-time approximability of MinCSP(Γ) were fully
arXiv:1601.04935v2
fatcat:w2lpubpnc5ccfndq67gjfezdmm