arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1610.01019cs.CC
收藏

常数因子可逼近的二值CSP的一个特征

Towards a Characterization of Constant-Factor Approximable Finite-Valued CSPs

Victor Dalmau, Andrei Krokhin, Rajsekar Manokaran

摘要:

本文研究了有限值约束满足问题(VCSPs)在固定有限区域上由有限函数构成的固定有限约束语言Γ的可逼近性. VCSP的一个实例由一个有限的变量集和一个属于Γ的函数之和给出,并且依赖于变量的一个子集。每个函数都接受[0,1]中的值,指定为其变量分配标签的成本,目标是找到最小化总和的变量标签分配。Ene等人最近的一个结果表明,在Γ包含等式关系的温和技术条件下,基本LP松弛对于VCSP(Γ)的常数因子逼近是最优的,除非唯一博弈猜想失败。利用CSP的代数方法,给出了VCSP(Γ)的基本LP松弛的积分间隙有限的新的自然代数条件.我们还展示了如何这些代数条件可以在原则上被用来轮的基本LP松弛的解决方案,以及如何,为几个例子,涵盖了所有以前已知的情况下,这导致高效的常数因子近似算法。最后,我们证明了另一个代数条件的缺乏导致NP-困难的常数因子近似。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑