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

自举动态距离预言机

Bootstrapping Dynamic Distance Oracles

Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos

摘要:

在全动态环境下设计近似全对距离预言机是动态图算法的核心问题之一。尽管对这一主题进行了广泛的研究,但Forster、Goranci和Henzinger [SODA'21]最近才介绍了打破任何非平凡近似的更新时间$O(\sqrt{n})$障碍的第一个结果,他们对任何参数$ρ\geq 1$,在近似比中使用$O(\log n)^{3ρ-2}$因子实现了$m^{1/ρ+o(1)}$摊销更新时间。在本文中,我们给出了第一个常数拉伸全动态距离预言机与一个小的多项式更新和查询时间。以前的工作需要至少一个多对数近似或更大的更新时间。我们的结果给出了拉伸和更新时间之间更细粒度的权衡,例如,我们可以在摊销更新时间$\tilde{O}(n^ρ)$中实现$O(\frac{1}{ρ^2})^{4/ρ}$的恒定拉伸,并且对于恒定参数$ρ<1$,查询时间$\tilde{O}(n^{ρ/8})$。我们的算法是随机的,并假设一个健忘的对手。我们的建设的核心技术思想是设计一个黑盒减少递减近似枢纽标记计划,完全动态的距离预言,这可能是独立的利益。然后,我们将这种减少重复应用于现有的递减算法,以引导我们的完全动态的解决方案。

英文摘要:

Designing approximate all-pairs distance oracles in the fully dynamic setting is one of the central problems in dynamic graph algorithms. Despite extensive research on this topic, the first result breaking the $O(\sqrt{n})$ barrier on the update time for any non-trivial approximation was introduced only recently by Forster, Goranci and Henzinger [SODA'21] who achieved $m^{1/ρ+o(1)}$ amortized update time with a $O(\log n)^{3ρ-2}$ factor in the approximation ratio, for any parameter $ρ\geq 1$. In this paper, we give the first constant-stretch fully dynamic distance oracle with a small polynomial update and query time. Prior work required either at least a poly-logarithmic approximation or much larger update time. Our result gives a more fine-grained trade-off between stretch and update time, for instance we can achieve constant stretch of $O(\frac{1}{ρ^2})^{4/ρ}$ in amortized update time $\tilde{O}(n^ρ)$, and query time $\tilde{O}(n^{ρ/8})$ for a constant parameter $ρ<1$. Our algorithm is randomized and assumes an oblivious adversary. A core technical idea underlying our construction is to design a black-box reduction from decremental approximate hub-labeling schemes to fully dynamic distance oracles, which may be of independent interest. We then apply this reduction repeatedly to an existing decremental algorithm to bootstrap our fully dynamic solution.

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

↑