Dalmau, V. and Krokhin, A. and Manokaran, R. (2015) 'Towards a characterization of constant-factor approximable Min CSPs.', in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms : San Diego, California, USA, January 4-6, 2015. New York: Society for Industrial and Applied Mathematics (SIAM), pp. 847-857. Proceedings.
We study the approximability of Minimum Constraint Satisfaction Problems (Min CSPs) with a fixed finite constraint language Γ on an arbitrary finite domain. The goal in such a problem is to minimize the number of unsatisfied constraints in a given instance of CSP(Γ). A recent result of Ene et al. says that, under the mild technical condition that Γ contains the equality relation, the basic LP relaxation is optimal for constant-factor approximation for Min CSP(Γ) unless the Unique Games Conjecture fails. Using the algebraic approach to the CSP, we introduce a new natural algebraic condition, stable probability distributions on symmetric polymorphisms of a constraint language, and show that the presence of such distributions on polymorphisms of each arity is necessary and sufficient for the finiteness of the integrality gap for the basic LP relaxation of Min CSP(Γ). We also show how stable distributions on symmetric polymorphisms can in principle be used to round solutions of the basic LP relaxation, and how, for several examples that cover all previously known cases, this leads to efficient constant-factor approximation algorithms for Min CSP(Γ). Finally, we show that the absence of another condition, which is implied by stable distributions, leads to NP-hardness of constant-factor approximation.
|Item Type:||Book chapter|
|Full text:||(AM) Accepted Manuscript|
Download PDF (164Kb)
|Publisher Web site:||http://dx.doi.org/10.1137/1.9781611973730.58|
|Publisher statement:||Copyright © 2015. by the Society for Industrial and Applied Mathematics|
|Date accepted:||16 September 2014|
|Date deposited:||23 March 2016|
|Date of first online publication:||22 December 2014|
|Date first made open access:||No date available|
Save or Share this output
|Look up in GoogleScholar|