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

最优化中基于树宽的易处理性的新极限

New Limits of Treewidth-based tractability in Optimization

Yuri Faenza, Gonzalo Muñoz, Sebastian Pokutta

摘要:

在优化问题中追求易处理性时,经常寻求稀疏结构。它们被利用从理论和计算的角度来处理复杂的问题,成为可管理的稀疏时,存在。树宽是这种结构的一个例子:这是一个图论参数,用来衡量一个图有多“像树”。几十年来,这个参数一直被用来分析各种优化问题的复杂性,并为这个参数有界的问题获得易于处理的算法。这项工作的目标是有助于理解的限制,基于树宽的易处理性优化。我们的结果如下。首先,我们证明,在一定意义上,已经知道的积极的结果扩展复杂性的基础上,低树宽是最好的可能。其次,在温和的假设下,我们证明了树宽是唯一的图论参数,产生易处理的广泛的一类优化问题,一个众所周知的事实,在机器学习的图形模型和约束满足问题,在这里,我们扩展到近似设置优化。

英文摘要:

Sparse structures are frequently sought when pursuing tractability in optimization problems. They are exploited from both theoretical and computational perspectives to handle complex problems that become manageable when sparsity is present. An example of this type of structure is given by treewidth: a graph theoretical parameter that measures how "tree-like" a graph is. This parameter has been used for decades for analyzing the complexity of various optimization problems and for obtaining tractable algorithms for problems where this parameter is bounded. The goal of this work is to contribute to the understanding of the limits of the treewidth-based tractability in optimization. Our results are as follows. First, we prove that, in a certain sense, the already known positive results on extension complexity based on low treewidth are the best possible. Secondly, under mild assumptions, we prove that treewidth is the only graph-theoretical parameter that yields tractability a wide class of optimization problems, a fact well known in Graphical Models in Machine Learning and in Constraint Satisfaction Problems, which here we extend to an approximation setting in Optimization.

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

↑