由对称竞赛对多态定义的广义易处理VCSP
Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms
摘要:
我们研究的优化问题,可以制定价值约束满足问题(VCSP)。一个问题,从VCSP的特点是由一个\emph{constraint language},一组固定的成本函数采取有限和无限的成本在有限域。问题的一个实例由语言中的成本函数之和指定,目标是最小化该和。我们感兴趣的是\emph{tractable}约束语言,也就是说,语言产生的VCSP实例可解决的多项式时间。Cohen等人(AIJ'06)已经证明了允许MJN多态性的约束语言是易处理的。此外,使用子模函数的最小化算法,Cohen等人(TCS'08)已经表明,允许STP(对称竞赛对)多态的约束语言是易处理的。我们概括这些结果表明,语言承认的MJN多态子域和STP多态子域的补充是听话的。该算法是一个减少的算法的语言承认一个STP多态。
英文摘要:
We study optimisation problems that can be formulated as valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a \emph{constraint language}, a fixed set of cost functions taking finite and infinite costs over a finite domain. An instance of the problem is specified by a sum of cost functions from the language and the goal is to minimise the sum. We are interested in \emph{tractable} constraint languages; that is, languages that give rise to VCSP instances solvable in polynomial time. Cohen et al. (AIJ'06) have shown that constraint languages that admit the MJN multimorphism are tractable. Moreover, using a minimisation algorithm for submodular functions, Cohen et al. (TCS'08) have shown that constraint languages that admit an STP (symmetric tournament pair) multimorphism are tractable. We generalise these results by showing that languages admitting the MJN multimorphism on a subdomain and an STP multimorphisms on the complement of the subdomain are tractable. The algorithm is a reduction to the algorithm for languages admitting an STP multimorphism.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。