The complexity and approximability of the constraint satisfaction problem (CSP) has been
actively studied over the past 20 years. A new version of the CSP, the promise CSP (PCSP) …

We propose a new algorithm for Promise Constraint Satisfaction Problems (PCSPs). It is a
combination of the Constraint Basic LP relaxation and the Affine IP relaxation (CLAP). We …

The complexity and approximability of the constraint satisfaction problem (CSP) has been
actively studied over the last 20 years. A new version of the CSP, the promise CSP (PCSP) …

A value of a CSP instance is typically defined as a fraction of constraints that can be
simultaneously met. We propose an alternative definition of a value of an instance and show …

For a constraint satisfaction problem (CSP), a robust satisfaction algorithm is one that
outputs an assignment satisfying most of the constraints on instances that are near …

We provide a unified framework to study hierarchies of relaxations for Constraint Satisfaction
Problems and their Promise variant. The idea is to split the description of a hierarchy into an …

A linearly ordered (LO) k-colouring of an r-uniform hypergraph assigns an integer from {1,...,
k} to every vertex so that, in every edge, the (multi) set of colours has a unique maximum …

The approximate graph coloring problem, whose complexity is unresolved in most cases,
concerns finding a-coloring of a graph that is promised to be-colorable, where. This problem …

The study of the complexity of the constraint satisfaction problem (CSP), centred around the
Feder-Vardi Dichotomy Conjecture, has been very prominent in the last two decades. After a …

We present new results on approximate colourings of graphs and, more generally,
approximate H-colourings and promise constraint satisfaction problems. First, we show NP …