arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1412.3987cs.CGcs.SCmath.OC
收藏

一种高效的预言机多面体边骨架计算方法

Efficient edge-skeleton computation for polytopes defined by oracles

Ioannis Z. Emiris, Vissarion Fisikopoulos, Bernd Gärtner

摘要:

在一般维数下,对于凸包或顶点枚举,没有已知的全多项式算法,即其复杂度多项式地依赖于输入和输出大小的算法。因此,重要的是要确定的问题(和多面体表示),总多项式时间的算法可以得到。我们提供了第一个总的多项式时间算法计算的边缘骨架(包括顶点枚举)的多面体的优化或分离预言,我们也给出了一个超集的边缘方向。我们还提供了一个空间效率的变体,我们的算法采用逆向搜萦。所有的复杂性界限都是指(oracle)图灵机模型。有许多多面体类自然地由神谕定义;对于其中的一些,顶点和面表示都不明显。我们考虑两个主要的应用程序,在那里我们获得(弱)总多项式时间算法:签署闵可夫斯基和凸多面体,其中多面体可以减去提供的签署和凸多面体,计算次级,结果,判别多面体。进一步的应用包括凸组合优化和凸整数规划,在那里我们提供了一种新的方法,从而消除了复杂性的指数依赖的维度。

英文摘要:

In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify problems (and polytope representations) for which total polynomial-time algorithms can be obtained. We offer the first total polynomial-time algorithm for computing the edge-skeleton (including vertex enumeration) of a polytope given by an optimization or separation oracle, where we are also given a superset of its edge directions. We also offer a space-efficient variant of our algorithm by employing reverse search. All complexity bounds refer to the (oracle) Turing machine model. There is a number of polytope classes naturally defined by oracles; for some of them neither vertex nor facet representation is obvious. We consider two main applications, where we obtain (weakly) total polynomial-time algorithms: Signed Minkowski sums of convex polytopes, where polytopes can be subtracted provided the signed sum is a convex polytope, and computation of secondary, resultant, and discriminant polytopes. Further applications include convex combinatorial optimization and convex integer programming, where we offer a new approach, thus removing the complexity's exponential dependence in the dimension.

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

↑