arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1204.1079cs.CC
收藏

线性规划在有值CSP问题上的作用

The Power of Linear Programming for Valued CSPs

Johan Thapper, Stanislav Zivny

摘要:

一类有值约束满足问题(VCSPs)的特征在于一个有值约束语言,一个有限域上的固定的成本函数集。问题的一个实例由语言中的成本函数之和指定,目标是使总和最小化。该框架包括并推广了研究充分的约束满足问题(CSP)和最大约束满足问题(Max-CSP)。我们的主要结果是一个精确的代数特征值约束语言的实例可以解决的基本线性规划松弛。利用这个结果,我们得到了几个新的和以前广泛开放的VCSP类的易处理性,包括值约束语言的问题:(1)任意格上的子模;(2)任意有限域上的双子模(也称为k-子模);(3)任意树上的弱(因此是强)树-子模。

英文摘要:

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. This framework includes and generalises well-studied constraint satisfaction problems (CSPs) and maximum constraint satisfaction problems (Max-CSPs). Our main result is a precise algebraic characterisation of valued constraint languages whose instances can be solved exactly by the basic linear programming relaxation. Using this result, we obtain tractability of several novel and previously widely-open classes of VCSPs, including problems over valued constraint languages that are: (1) submodular on arbitrary lattices; (2) bisubmodular (also known as k-submodular) on arbitrary finite domains; (3) weakly (and hence strongly) tree-submodular on arbitrary trees.

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

↑