We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Robust algorithms with polynomial loss for near-unanimity CSPs.

Dalmau, V. and Kozik, M. and Krokhin, A. and Makarychev, K. and Makarychev, Y. and Oprsal, J. (2019) 'Robust algorithms with polynomial loss for near-unanimity CSPs.', SIAM journal on computing., 48 (6). pp. 1763-1795.


An instance of the Constraint Satisfaction Problem (CSP) is given by a family of constraints on overlapping sets of variables, and the goal is to assign values from a xed domain to the variables so that all constraints are satised. In the optimization version, the goal is to maximize the number of satised constraints. An approximation algorithm for CSP is called robust if it outputs an assignment satisfying an (1????g("))-fraction of constraints on any (1????")-satisable instance, where the loss function g is such that g(") ! 0 as " ! 0. We study how the robust approximability of CSPs depends on the set of constraint relations allowed in instances, the so-called constraint language. All constraint languages admitting a robust polynomial-time algorithm (with some g) have been characterised by Barto and Kozik, with the general bound on the loss g being doubly exponential, specically g(") = O((log log(1="))= log(1=")). It is natural to ask when a better loss can be achieved: in particular, polynomial loss g(") = O("1=k) for some constant k. In this paper, we consider CSPs with a constraint language having a nearunanimity polymorphism. This general condition almost matches a known necessary condition for having a robust algorithm with polynomial loss. We give two randomized robust algorithms with polynomial loss for such CSPs: one works for any near-unanimity polymorphism and the parameter k in the loss depends on the size of the domain and the arity of the relations in ????, while the other works for a special ternary near-unanimity operation called dual discriminator with k = 2 for any domain size. In the latter case, the CSP is a common generalisation of Unique Games with a xed domain and 2-Sat. In the former case, we use the algebraic approach to the CSP. Both cases use the standard semidenite programming relaxation for CSP.

Item Type:Article
Full text:Publisher-imposed embargo
(AM) Accepted Manuscript
File format - PDF
Full text:(VoR) Version of Record
Download PDF
Publisher Web site:
Publisher statement:© 2019, Society for Industrial and Applied Mathematics.
Date accepted:04 September 2019
Date deposited:11 September 2019
Date of first online publication:26 November 2019
Date first made open access:28 November 2019

Save or Share this output

Look up in GoogleScholar