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

近似单源距离敏感性预言机的近线性时间构造

A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles

Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa

AI总结:

本文首次为有向带权图提出近线性时间的 $(1+ε)$-近似单源距离敏感性预言机构造算法,突破 $\tilde{O}(mn)$ 时间与近似因子 3 的限制,并证明精确计算的条件下界不适用于近似情形。

摘要:

对于带权输入图 $G=(V, E, w)$ 和源顶点 $s \in V$,一个 \emph{$α$-近似顶点容错距离敏感性预言机}(\emph{$α$-VSDO})是一种数据结构,对于任意查询 $(x, t) \in V \times V$,它回答在 $G-x$ 中从 $s$ 到 $t$ 的 $α$-近似距离。它是所谓单源替换路径问题(SSRP)的数据结构版本。在本文中,我们提出了一种新的\emph{近线性时间}算法,用于为任意具有多项式有界整数边权的有向输入图构造 $(1 + ε)$-VSDO。更准确地说,所提出的预言机达到 $\tilde{O}(m \log (nW)/ ε+ n \log^2 (nW)/ε^2)$ 的构造时间、$\tilde{O}(n \log (nW) / ε)$ 的空间大小和 $\tilde{O}(1/ε)$ 的查询时间,其中 $n$ 是顶点数,$m$ 是边数,$W$ 是最大边权。这些界在忽略多对数因子的意义下都是最优的。据我们所知,这是第一个针对具有一般边权函数的有向图、突破 $\tilde{O}(mn)$ 计算时间的非平凡 SSRP/VSDO 算法,也是第一个打破近似因子 3 的近线性时间构造。即使对于无向无权图,这样的构造此前也是未知的。此外,我们的结果意味着已知的精确 SSRP 计算的条件下界不适用于近似情形。

英文摘要:

An \emph{$α$-approximate vertex fault-tolerant distance sensitivity oracle} (\emph{$α$-VSDO}) for a weighted input graph $G=(V, E, w)$ and a source vertex $s \in V$ is the data structure answering an $α$-approximate distance from $s$ to $t$ in $G-x$ for any given query $(x, t) \in V \times V$. It is a data structure version of the so-called single-source replacement path problem (SSRP). In this paper, we present a new \emph{nearly linear-time} algorithm of constructing a $(1 + ε)$-VSDO for any directed input graph with polynomially bounded integer edge weights. More precisely, the presented oracle attains $\tilde{O}(m \log (nW)/ ε+ n \log^2 (nW)/ε^2)$ construction time, $\tilde{O}(n \log (nW) / ε)$ size, and $\tilde{O}(1/ε)$ query time, where $n$ is the number of vertices, $m$ is the number of edges, and $W$ is the maximum edge weight. These bounds are all optimal up to polylogarithmic factors. To the best of our knowledge, this is the first non-trivial algorithm for SSRP/VSDO beating $\tilde{O}(mn)$ computation time for directed graphs with general edge weight functions, and also the first nearly linear-time construction breaking approximation factor 3. Such a construction has been unknown even for undirected and unweighted graphs. In addition, our result implies that the known conditional lower bounds for the exact SSRP computation does not apply to the case of approximation.

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

↑