离散优化中的易处理三角形和无交凸性
Tractable Triangles and Cross-Free Convexity in Discrete Optimisation
摘要:
离散变量的一元函数和成对函数之和的最小化问题是一个NP难问题,在马尔可夫随机场(MRF)中的MAP配置计算、Gibbs能量最小化、二值约束满足问题(VCSPs)求解等方面有着广泛的应用。我们研究的计算复杂性类离散优化问题,只允许某些类型的成本在每个三角形的变量值分配给三个不同的变量。我们表明,对于几个计算问题,唯一的非平凡易处理的类是众所周知的最大匹配问题和最近发现的联合赢家属性。我们的研究结果,除了在所研究的情况下给出完整的分类,提供指导,在搜索混合听话的类,也就是说,类的问题,不被捕获的功能(如子模块)或结构的问题图(如有界树宽)的限制。此外,我们引入了一类问题的凸势函数的交叉自由集的分配。我们证明,虽然只施加两个条件之一,使问题NP-难,两者的结合产生了一个新的听话的类满足交叉自由凸性,它概括了联合赢家财产的无界arity问题。
英文摘要:
The minimisation problem of a sum of unary and pairwise functions of discrete variables is a general NP-hard problem with wide applications such as computing MAP configurations in Markov Random Fields (MRF), minimising Gibbs energy, or solving binary Valued Constraint Satisfaction Problems (VCSPs). We study the computational complexity of classes of discrete optimisation problems given by allowing only certain types of costs in every triangle of variable-value assignments to three distinct variables. We show that for several computational problems, the only non- trivial tractable classes are the well known maximum matching problem and the recently discovered joint-winner property. Our results, apart from giving complete classifications in the studied cases, provide guidance in the search for hybrid tractable classes; that is, classes of problems that are not captured by restrictions on the functions (such as submodularity) or the structure of the problem graph (such as bounded treewidth). Furthermore, we introduce a class of problems with convex cardinality functions on cross-free sets of assignments. We prove that while imposing only one of the two conditions renders the problem NP-hard, the conjunction of the two gives rise to a novel tractable class satisfying the cross-free convexity property, which generalises the joint-winner property to problems of unbounded arity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。