关于MST比率:理论界与求最大值的复杂度
On the MST-ratio: Theoretical Bounds and Complexity of Finding the Maximum
AI总结:
该研究针对点集的最大MST比率问题,证明维度为输入参数时求解该问题是NP难的,给出二次时间的近似算法,推导了度量空间中最大MST比率的上界,还探究了点集所有着色下的平均MST比率相关性质。
摘要:
给定$\Rspace^d$中的有限红、蓝点集,MST比率定义为红点集与蓝点集各自的欧几里得最小生成树总长度之和,除以二者并集的欧几里得最小生成树长度。由于MST比率在用于研究点集的拓扑模型中具有直观解释,且在空间生物学中有应用,近年来受到关注。点集的最大MST比率是指将点集的点进行红、蓝正常着色时,所有着色方案下MST比率的最大值。我们证明,当维度作为输入的一部分时,求解给定点集的最大MST比率是NP难的。此外,我们提出了一个二次时间的$3$近似算法来解决该问题。作为证明的一部分,我们表明在任意度量空间中,最大MST比率小于$3$。另外,我们研究了含$n$个点的集合在所有着色下的平均MST比率。我们证明该平均值始终至少为$\frac{n-2}{n-1}$,并且对于在$d$维单位立方体中均匀分布的$n$个随机点,当$n$趋于无穷时,该平均值的期望趋于$\sqrt[d]{2}$。
英文摘要:
Given a finite set of red and blue points in $\Rspace^d$, the MST-ratio is defined as the total length of the Euclidean minimum spanning trees of the red points and the blue points, divided by the length of the Euclidean minimum spanning tree of their union. The MST-ratio has recently gained attention due to its direct interpretation in topological models for studying point sets with applications in spatial biology. The maximum MST-ratio of a point set is the maximum MST-ratio over all proper colorings of its points by red and blue. We prove that finding the maximum MST-ratio of a given point set is NP-hard when the dimension is part of the input. Moreover, we present a quadratic-time $3$-approximation algorithm for this problem. As part of the proof, we show that, in any metric space, the maximum MST-ratio is smaller than $3$. Additionally, we study the average MST-ratio over all colorings of a set of $n$ points. We show that this average is always at least $\frac{n-2}{n-1}$, and for $n$ random points uniformly distributed in a $d$-dimensional unit cube, the average tends to $\sqrt[d]{2}$ in expectation as $n$ approaches infinity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。