最大权凸多面体
Maximum Weight Convex Polytope
摘要:
研究了最大权凸多面体问题,目标是找到一个最大化所有封闭点的总权的凸多面体。在这项工作之前,这个问题的唯一已知的结果是$O(n^3)$算法的情况下,$2$尺寸由于Bautista等人。我们表明,这个问题成为$\mathcal{NP}$ -很难精确地解决$3$尺寸,和$\mathcal{NP}$ -很难近似在$n^{1/2-ε}$中的任何$ε> 0$在$4$或更多的维度。% \polyAPX -在$4$维度中完成,即使具有二进制权重。我们还给出了一个新的算法$2$尺寸,虽然与相同的$O(n^3)$运行时间复杂度的算法的Bautsita等人。
英文摘要:
We study the maximum weight convex polytope problem, in which the goal is to find a convex polytope maximizing the total weight of enclosed points. Prior to this work, the only known result for this problem was an $O(n^3)$ algorithm for the case of $2$ dimensions due to Bautista et al. We show that the problem becomes $\mathcal{NP}$-hard to solve exactly in $3$ dimensions, and $\mathcal{NP}$-hard to approximate within $n^{1/2-ε}$ for any $ε> 0$ in $4$ or more dimensions. %\polyAPX-complete in $4$ dimensions even with binary weights. We also give a new algorithm for $2$ dimensions, albeit with the same $O(n^3)$ running time complexity as that of the algorithm of Bautsita et al.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。