改进预处理时间的近似距离预言机
Approximate Distance Oracles with Improved Preprocessing Time
摘要:
给定一个无向图$G$与$m$边,$n$顶点,和非负边权重,并给定一个整数$k\geq 1$,我们表明,对于一些通用常数$c$,一个$(2k-1)$ -近似距离预言的$G$的大小$O(kn^{1 + 1/k})$可以在$O(\sqrt km + kn^{1 + c/\sqrt k})$时间构造,并可以回答查询在$O(k)$时间。我们还给出了一个oracle,这是更快的较小的$k$。我们的研究结果打破了Baswana和Kavitha的二次预处理时间界的所有$k\geq 6$和改善的$O(kmn^{1/k})$时间界的Thorup和Zwick除了非常稀疏的图形和小$k$。当$m = Ω(n^{1 + c/\sqrt k})$和$k = O(1)$,我们的预言是最优的w.r.t.\拉伸,大小,预处理时间和查询时间,假设一个被广泛认为的周长猜想由Erdos。
英文摘要:
Given an undirected graph $G$ with $m$ edges, $n$ vertices, and non-negative edge weights, and given an integer $k\geq 1$, we show that for some universal constant $c$, a $(2k-1)$-approximate distance oracle for $G$ of size $O(kn^{1 + 1/k})$ can be constructed in $O(\sqrt km + kn^{1 + c/\sqrt k})$ time and can answer queries in $O(k)$ time. We also give an oracle which is faster for smaller $k$. Our results break the quadratic preprocessing time bound of Baswana and Kavitha for all $k\geq 6$ and improve the $O(kmn^{1/k})$ time bound of Thorup and Zwick except for very sparse graphs and small $k$. When $m = Ω(n^{1 + c/\sqrt k})$ and $k = O(1)$, our oracle is optimal w.r.t.\ both stretch, size, preprocessing time, and query time, assuming a widely believed girth conjecture by Erdős.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。