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

一般度量空间中的大规模并行最小生成树

Massively Parallel Minimum Spanning Tree in General Metric Spaces

Northeastern University(东北大学);Google Research(谷歌研究)

Amir Azarmehr, Soheil Behnezhad, Rajesh Jayaram, Jakub Łącki, Vahab Mirrokni, Peilin Zhong

AI总结:

针对一般度量空间中的最小生成树问题,提出首个$o(\log n)$轮MPC算法,实现$(1+\varepsilon)$近似,并证明匹配的下界。

摘要:

我们研究了大规模并行计算(MPC)模型中的最小生成树(MST)问题。我们特别关注MPC的严格次线性(strictly sublinear)机制,其中每台机器的空间为$O(n^δ)$。这里$n$是顶点数,常数$δ\in (0, 1)$可以任意小。MST问题在MPC模型中有一个简单且众所周知的$O(\log n)$轮算法。当权重可以任意时,这与由著名的1vs2-Cycle猜想推导出的条件下界$Ω(\log n)$相匹配。因此,大量文献专注于在问题的更结构化变体中打破对数障碍,例如当顶点对应于低维[ANOY14, STOC'14]或高维欧几里得空间[JMNZ, SODA'24]中的点时。在这项工作中,我们更一般地关注度量空间。即,所有成对权重都被提供并保证满足三角不等式,但除此之外不受约束。我们证明,对于任何$\varepsilon > 0$,可以在$O(\log \frac{1}{\varepsilon} + \log \log n)$轮内找到一个$(1+\varepsilon)$近似MST,这是在此设置中首次找到任何常数近似的$o(\log n)$轮算法。除了适用于更一般的权重函数外,我们的算法还略微改善了[JMNZ24, SODA'24]的$O(\log \log n \cdot \log \log \log n)$轮复杂度,并将其近似比从一个大常数显著提高到$1+\varepsilon$。在下界方面,我们证明在1vs2-Cycle猜想下,在一般度量中找到$(1+\varepsilon)$近似MST需要$Ω(\log \frac{1}{\varepsilon})$轮。值得注意的是,虽然MPC模型中许多现有的基于1vs2-Cycle猜想的下界仅对“组件稳定”算法成立,但我们的下界适用于*所有*算法。

英文摘要:

We study the minimum spanning tree (MST) problem in the massively parallel computation (MPC) model. Our focus is particularly on the *strictly sublinear* regime of MPC where the space per machine is $O(n^δ)$. Here $n$ is the number of vertices and constant $δ\in (0, 1)$ can be made arbitrarily small. The MST problem admits a simple and folklore $O(\log n)$-round algorithm in the MPC model. When the weights can be arbitrary, this matches a conditional lower bound of $Ω(\log n)$ which follows from a well-known 1vs2-Cycle conjecture. As such, much of the literature focuses on breaking the logarithmic barrier in more structured variants of the problem, such as when the vertices correspond to points in low- [ANOY14, STOC'14] or high-dimensional Euclidean spaces [JMNZ, SODA'24]. In this work, we focus more generally on metric spaces. Namely, all pairwise weights are provided and guaranteed to satisfy the triangle inequality, but are otherwise unconstrained. We show that for any $\varepsilon > 0$, a $(1+\varepsilon)$-approximate MST can be found in $O(\log \frac{1}{\varepsilon} + \log \log n)$ rounds, which is the first $o(\log n)$-round algorithm for finding any constant approximation in this setting. Other than being applicable to more general weight functions, our algorithm also slightly improves the $O(\log \log n \cdot \log \log \log n)$ round-complexity of [JMNZ24, SODA'24] and significantly improves its approximation from a large constant to $1+\varepsilon$. On the lower bound side, we prove that under the 1vs2-Cycle conjecture, $Ω(\log \frac{1}{\varepsilon})$ rounds are needed for finding a $(1+\varepsilon)$-approximate MST in general metrics. It is worth noting that while many existing lower bounds in the MPC model under the 1vs2-Cycle conjecture only hold against "component stable" algorithms, our lower bound applies to *all* algorithms.

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

↑