arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.19484cs.CGcs.CCmath.OC
收藏

最大Solow-Polasky多样性子集选择问题在欧几里得平面中也是NP难的

Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane

Faculty of Information Technology, University of Jyväskylä(于韦斯屈莱大学信息技术学院);Leiden Center of Advanced Computer Science, Leiden University(莱顿大学高级计算机科学中心)

Michael T. M. Emmerich, Ksenia Pereverdieva, André H. Deutz

AI总结:

本文证明在欧几里得平面中,选择特定数量的点以最大化Solow-Polasky多样性指标是NP难的,且该结果在一般度量空间中也成立,但证明方法不同。

摘要:

我们证明,对于每一个固定的θ_0>0,对于有限点集在R²中的欧几里得度量下,选择给定数量的子集以最大化Solow-Polasky多样性指标是NP难的,因此也适用于R^d中的有限点集,其中d≥2。这严格加强了我们对一般度量空间的NP难性结果,显示在欧几里得平面的严苛几何限制下仍保持难度。同时,欧几里得证明技术与先前针对任意度量空间的更直观论证不同,且一般度量空间的构造不能直接转换到欧几里得环境。在先前的证明中,可以使用针对任意度量的精确构造,本质上利用了双距离结构。相比之下,这种精确实现不可用于固定维数的欧几里得空间,因此当前的归约需要真正的几何论证。我们的欧几里得证明基于两个距离阈值,允许我们通过稳健不等式而不是一般度量设置中使用的精确构造来区分yes实例和no实例。主要技术成分是一个用于非线性目标函数1^T Z^{-1} 1的有界框比较引理,其中Z_ij=e^{-θ_0 d(x_i,x_j)}。该引理控制了成对距离扰动的影响,足以将归约所创造的差距转移过来。归约来自几何单位圆独立集问题。我们以有限R²子集的几何形式呈现主要论证,附录补充了需要多项式时间归约的位复杂度细节。

英文摘要:

We prove that, for every fixed $θ_0>0$, selecting a subset of prescribed cardinality that maximizes the Solow--Polasky diversity indicator is NP-hard for finite point sets in $\mathbb{R}^2$ with the Euclidean metric, and therefore also for finite point sets in $\mathbb{R}^d$ for every fixed dimension $d \ge 2$. This strictly strengthens our earlier NP-hardness result for general metric spaces by showing that hardness persists under the severe geometric restriction to the Euclidean plane. At the same time, the Euclidean proof technique is different from the conceptually easier earlier argument for arbitrary metric spaces, and that general metric-space construction does not directly translate to the Euclidean setting. In the earlier proof one can use an exact construction tailored to arbitrary metrics, essentially exploiting a two-distance structure. In contrast, such an exact realization is unavailable in fixed-dimensional Euclidean space, so the present reduction requires a genuinely geometric argument. Our Euclidean proof is based on two distance thresholds, which allow us to separate yes-instances from no-instances by robust inequalities rather than by the exact construction used in the general metric setting. The main technical ingredient is a bounded-box comparison lemma for the nonlinear objective $\mathbf{1}^{\top}Z^{-1}\mathbf{1}$, where $Z_{ij}=e^{-θ_0 d(x_i,x_j)}$. This lemma controls the effect of perturbations in the pairwise distances well enough to transfer the gap created by the reduction. The reduction is from \emph{Geometric Unit-Disk Independent Set}. We present the main argument in geometric form for finite subsets of $\mathbb{R}^2$, with an appendix supplying the bit-complexity details needed for polynomial-time reducibility.

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

↑