Near-Optimal Approximate Decremental All Pairs Shortest Paths
Near-Optimal Approximate Decremental All Pairs Shortest Paths
复制标题
近乎最优的近似递减所有对最短路径
DOI：
10.1109/focs.2018.00025
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
S. Chechik
中科院分区：
文献类型：
--
作者：
S. Chechik
在本文中，我们考虑了减小的全对最短路径（APSP）问题，在graph g中，目标是在一系列在线对手边缘删除序列下，在G中维持G中所有节点之间的近似最短路径（2 +ε）K-1拉伸，o（m n^1/k +o（1）log（n w））总更新时间和o（loglog（n w））查询时间的降低APSP算法（2 +ε）k-1 strave，o（m n^1/k +o（1）log（n w））对于固定常数ε，其中W是最大边缘重量（假设最小边缘重量为1），而K是任何整数参数。
In this paper we consider the decremental approximate all-pairs shortest paths (APSP) problem, where given a graph G the goal is to maintain approximate shortest paths between all pairs of nodes in G under a sequence of online adversarial edge deletions. We present a decremental APSP algorithm for undirected weighted graphs with (2+ε)k-1 stretch, O(m n^1/k +o(1) log(n W)) total update time and O(loglog(n W)) query time for a fixed constant ε, where W is the maximum edge weight (assuming the minimum edge weight is 1) and k is any integer parameter. This is an exponential improvement both in the stretch and in the query time over previous works.