改进查询时间的近似距离预言机
Approximate Distance Oracles with Improved Query Time
摘要:
给定一个无向图$G$与$m$边,$n$顶点,和非负边权重,并给定一个整数$k\geq 2$,我们表明,$(2k-1)$ -近似距离预言的$G$的大小$O(kn^{1 + 1/k})$和$O(\log k)$查询时间可以构建在$O(\min\{kmn^{1/k},\sqrt km + kn^{1 + c/\sqrt k}\})$时间为一些常数$c$。这改进了Thorup和Zwick的$O(k)$查询时间。此外,对于任何$0 < ε\leq 1$,我们给出了一个大小为$O(kn^{1 + 1/k})$的预言机,该预言机在$O(1/ε)$时间内回答$((2 + ε)k)$ -近似距离查询。以$k$ -因子的大小为代价,这改进了由孟德尔和Naor的恒定查询时间预言所实现的$128k$近似,并接近了大小和拉伸之间的最佳可能权衡,这是由广泛认为的Erdos周长猜想所暗示的。对于任何常数$ε> 0$和$k = O(\log n/\log\log n)$,我们可以匹配孟德尔和Naor的$O(n^{1 + 1/k})$大小界限。
英文摘要:
Given an undirected graph $G$ with $m$ edges, $n$ vertices, and non-negative edge weights, and given an integer $k\geq 2$, we show that a $(2k-1)$-approximate distance oracle for $G$ of size $O(kn^{1 + 1/k})$ and with $O(\log k)$ query time can be constructed in $O(\min\{kmn^{1/k},\sqrt km + kn^{1 + c/\sqrt k}\})$ time for some constant $c$. This improves the $O(k)$ query time of Thorup and Zwick. Furthermore, for any $0 < ε\leq 1$, we give an oracle of size $O(kn^{1 + 1/k})$ that answers $((2 + ε)k)$-approximate distance queries in $O(1/ε)$ time. At the cost of a $k$-factor in size, this improves the $128k$ approximation achieved by the constant query time oracle of Mendel and Naor and approaches the best possible tradeoff between size and stretch, implied by a widely believed girth conjecture of Erdős. We can match the $O(n^{1 + 1/k})$ size bound of Mendel and Naor for any constant $ε> 0$ and $k = O(\log n/\log\log n)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。