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

线性规划在有值CSP问题上的幂:一个构造性刻画

The power of linear programming for valued CSPs: a constructive characterization

Vladimir Kolmogorov

摘要:

一类有值约束满足问题(VCSPs)的特征在于一个有值约束语言,一个有限域上的固定的成本函数集。问题的一个实例由语言中的成本函数之和指定,目标是使总和最小化。本文研究了哪类有限值语言可以用基本线性规划松弛法(BLP)精确求解。Thapper和Zivny证明了[20],如果BLP解决了语言,那么语言允许二元交换分数多态性。我们证明,反之亦然。这导致了一个必要和充分条件,可以检查在多项式时间为一个给定的语言。与此相反,[20]的前一个充分必要条件包含了无穷多个不等式。最近,Thapper和Zivny [21]表明(特别是使用本文介绍的技术)不满足我们条件的核心语言是NP难的。总之,这些结果意味着有限值语言可以使用线性规划来解决,或者是NP-难的。

英文摘要:

A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. An instance of the problem is specified by a sum of cost functions from the language with the goal to minimise the sum. We study which classes of finite-valued languages can be solved exactly by the basic linear programming relaxation (BLP). Thapper and Zivny showed [20] that if BLP solves the language then the language admits a binary commutative fractional polymorphism. We prove that the converse is also true. This leads to a necessary and a sufficient condition which can be checked in polynomial time for a given language. In contrast, the previous necessary and sufficient condition due to [20] involved infinitely many inequalities. More recently, Thapper and Zivny [21] showed (using, in particular, a technique introduced in this paper) that core languages that do not satisfy our condition are NP-hard. Taken together, these results imply that a finite-valued language can either be solved using Linear Programming or is NP-hard.

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

↑