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 …

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 …

For many constraint satisfaction problems, the algorithm which chooses a random
assignment achieves the best possible approximation ratio. For instance, a simple random …

The maximum constraint satisfaction problem (Max CSP) is the following computational
problem: an instance is a finite collection of constraints on a set of variables, and the goal is …

Abstract The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most
two r-valued variables per clause. For instances with n variables and m binary clauses, we …

Let D, called the domain, be a fixed finite set and let Γ, called the valued constraint
language, be a fixed set of functions of the form f:D^m→Q∪{∞\}, where different functions …

Given a constraint satisfaction problem (CSP) on n variables, x1, x 2,…, xn∊{±1}, and m
constraints, aglobal cardinality constraint has the form of where p∊(Ω (1), 1-Ω (1)) and pn is …

In this paper we present a new algorithm for solving weighted csps (wcsp). This involves first
creating an ordinary unweighted csp, \mathcalP, by hardening all soft constraints of the …

Generalised CNFs are considered using such literals, which exclude exactly one possible
value from the domain of the variable. First we consider poly-time SAT decision (and fixed …

In this thesis we study a constraint optimisation problem called the maximum solution
problem, henceforth referred to as Max Sol. It is defined as the problem of optimising a linear …