arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.07327cs.CCcs.DM
收藏

一般值CSP的复杂性

The Complexity of General-Valued CSPs

Vladimir Kolmogorov, Andrei Krokhin, Michal Rolinek

摘要:

值约束满足问题(VCSP)的一个例子是由一个有限的变量集,一个有限的标签域,和一个函数的总和,每个函数取决于一个子集的变量。每个函数可以取有限值,指定将标签分配给其变量的成本,也可以取无限值,表示不可行的分配。我们的目标是找到一个标签分配给变量,使总和最小化。我们研究(假设P $\ne$ NP)这个非常普遍的问题的复杂性如何取决于允许在实例中的函数集,即所谓的约束语言。当所有允许的函数在$\{0,\infty\}$中取值时的情况对应于普通CSP,其中仅处理可行性问题并且没有优化。这种情况是代数CSP二分法猜想的主题,预测哪些约束语言CSP是易处理的,哪些是NP难的。当所有允许的函数只取有限值的情况对应于有限值CSP,其中可行性方面是平凡的,并且只处理优化问题。有限值CSP的复杂性是由Thapper和Krivnovelik完全分类的。Kozik和Ochremiak最近给出了具有固定约束语言的一般值CSP可处理的代数必要条件。作为我们的主要结果,我们证明了,如果一个约束语言满足这个代数必要条件,和可行性CSP对应的VCSP与这种语言是易处理的,那么VCSP是易处理的。该算法是可行性CSP和标准LP松弛的假设算法的简单组合。作为一个推论,我们得到了一个二分法的普通CSP将意味着一个二分法的一般值CSP。

英文摘要:

An instance of the Valued Constraint Satisfaction Problem (VCSP) is given by a finite set of variables, a finite domain of labels, and a sum of functions, each function depending on a subset of the variables. Each function can take finite values specifying costs of assignments of labels to its variables or the infinite value, which indicates infeasible assignments. The goal is to find an assignment of labels to the variables that minimizes the sum. We study (assuming that P $\ne$ NP) how the complexity of this very general problem depends on the set of functions allowed in the instances, the so-called constraint language. The case when all allowed functions take values in $\{0,\infty\}$ corresponds to ordinary CSPs, where one deals only with the feasibility issue and there is no optimization. This case is the subject of the Algebraic CSP Dichotomy Conjecture predicting for which constraint languages CSPs are tractable and for which NP-hard. The case when all allowed functions take only finite values corresponds to finite-valued CSP, where the feasibility aspect is trivial and one deals only with the optimization issue. The complexity of finite-valued CSPs was fully classified by Thapper and Živný. An algebraic necessary condition for tractability of a general-valued CSP with a fixed constraint language was recently given by Kozik and Ochremiak. As our main result, we prove that if a constraint language satisfies this algebraic necessary condition, and the feasibility CSP corresponding to the VCSP with this language is tractable, then the VCSP is tractable. The algorithm is a simple combination of the assumed algorithm for the feasibility CSP and the standard LP relaxation. As a corollary, we obtain that a dichotomy for ordinary CSPs would imply a dichotomy for general-valued CSPs.

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

↑