In this paper we study the approximability of (Finite-)Valued Constraint Satisfaction Problems (VCSPs) with a fixed finite constraint language Γ consisting of finitary functions on a fixed finite domain. An instance of VCSP is given by a finite set of variables and a sum of functions belonging to Γ and depending on a subset of the variables. Each function takes values in [0, 1] specifying costs of assignments of labels to its variables, and the goal is to find an assignment of labels to the variables that minimizes the sum. 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 VCSP(Γ) unless the Unique Games Conjecture fails. Using the algebraic approach to the CSP, we give new natural algebraic conditions for the finiteness of the integrality gap for the basic LP relaxation of VCSP(Γ). We also show how these algebraic conditions 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. Finally, we show that the absence of another algebraic condition leads to NP-hardness of constant-factor approximation.
A dichotomy theorem for conservative general-valued CSPs
研究了有值约束满足问题(VCSP)的复杂性.一个问题,从VCSP的特点是一个\emph{constraint language},一个固定的成本函数在有限域。问题的一个实例由语言中的成本函数之和指定,目标是最小化该和。我们考虑的情况下,所谓的\emph{conservative}语言,也就是说,语言包含所有的一元成本函数,从而允许任意限制域的变量。在这种情况下,我们证明了一个类似Schaefer的二分法定理:如果语言中的所有代价函数都满足一定的条件(由\emph{STP and MJN multimorphisms}的互补组合指定),那么任何实例都可以在多项式时间内通过Kolmogorov和Zivny的算法(arXiv:1008.3104v1)求解,否则语言是NP-难的。这推广了Takhanov(STACS'10)和Kolmogorov和Zivny(arXiv:1008.1555v1)最近的结果,Takhanov(STACS'10)认为$\{0,\infty\}$值语言包含额外的所有有限值一元代价函数,Kolmogorov和Zivny(arXiv:1008.1555v1)认为\emph{finite-valued}保守语言。
Algebraic Properties of Valued Constraint Satisfaction Problem
本文提出了一个代数框架的最优化问题表示为价值约束满足问题。我们的结果推广了Bulatov等人[SICOMP 2005]提供的决策版本(CSP)的代数框架。我们引入了加权代数和簇的概念,并使用Cohen等人[SICOMP 2013]的Galois连接将VCSP语言与加权代数联系起来。我们表明,VCSP的难度只取决于相关的加权代数生成的加权品种。通过对CSP结果的分析,我们展示了核和刚性核的减少,这使我们能够专注于幂等加权品种。此外,我们提出了一个类似的代数CSP二分法猜想;证明了硬度方向,并验证了它与二元集上的VCSP [Cohen et al. 2006],有限值VCSP [Thapper and Zivny 2013]和保守VCSP [Kolmogorov and Zivny 2013]的已知结果一致。
A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
Institute of Algebra, TU Dresden(德累斯顿工业大学代数研究所);Univ Lyon, CNRS, ENS de Lyon, Université Claude Bernard Lyon 1, LIP UMR5668(里昂大学、法国国家科学研究中心、巴黎高等师范学院里昂分校、里昂第一大学LIP实验室);Institute of Discrete Mathematics and Geometry, TU Wien(维也纳工业大学离散数学与几何研究所)