arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2511.04775cs.DS
收藏

APSP 的改进加法近似算法

Improved Additive Approximation Algorithms for APSP

MIT(麻省理工学院);ETH Zurich(苏黎世联邦理工学院)

Ce Jin, Yael Kirkpatrick, Michał Stawarz, Virginia Vassilevska Williams

AI总结:

本文针对无向无权图的 APSP 加法近似问题,通过将图分解为常数直径簇和低度顶点剩余部分并结合标准快速矩阵乘法,改进了 +2、+4、+6 近似算法的时间复杂度。

摘要:

全对最短路径(APSP)是理论计算机科学中的一个基础问题。自 Dor、Halperin 和 Zwick [SICOMP'01] 的工作以来,无向无权图中的 APSP 近似问题已被研究多年。许多近期工作尝试利用快速矩阵乘法的代数工具来改进这些原始算法。我们在以下问题上改进了这些结果。对于 +2 近似 APSP,最先进的算法运行时间为 O(n^{2.259}) [Dürr, IPL 2023; Deng, Kirkpatrick, Rong, Vassilevska Williams 和 Zhong, ICALP 2022]。我们给出了一个改进算法,运行时间为 O(n^{2.2255})。对于 +4 和 +6 近似 APSP,我们分别实现了 O(n^{2.1462}) 和 O(n^{2.1026}) 的时间复杂度,改进了 [Saha 和 Ye, SODA 2024] 所取得的先前 O(n^{2.155}) 和 O(n^{2.103}) 的结果。与先前工作不同,我们没有使用有界差分 (min,+)-乘积算法这一“重锤”。相反,我们的算法基于一种简单技术,该技术将输入图分解为少量具有常数直径的簇以及由低度顶点组成的剩余部分,这一技术在最短路径问题研究中可能具有独立意义。然后我们仅使用标准快速矩阵乘法来获得我们的改进。

英文摘要:

The All-Pairs Shortest Paths (APSP) is a foundational problem in theoretical computer science. Approximating APSP in undirected unweighted graphs has been studied for many years, beginning with the work of Dor, Halperin and Zwick [SICOMP'01]. Many recent works have attempted to improve these original algorithms using the algebraic tools of fast matrix multiplication. We improve on these results for the following problems. For $+2$-approximate APSP, the state-of-the-art algorithm runs in $O(n^{2.259})$ time [Dürr, IPL 2023; Deng, Kirkpatrick, Rong, Vassilevska Williams, and Zhong, ICALP 2022]. We give an improved algorithm in $O(n^{2.2255})$ time. For $+4$ and $+6$-approximate APSP, we achieve time complexities $O(n^{2.1462})$ and $O(n^{2.1026})$ respectively, improving the previous $O(n^{2.155})$ and $O(n^{2.103})$ achieved by [Saha and Ye, SODA 2024]. In contrast to previous works, we do not use the big hammer of bounded-difference $(\min,+)$-product algorithms. Instead, our algorithms are based on a simple technique that decomposes the input graph into a small number of clusters of constant diameter and a remainder of low degree vertices, which could be of independent interest in the study of shortest paths problems. We then use only standard fast matrix multiplication to obtain our improvements.

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

↑