A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Approximate Distance Oracles with Improved Query Time
[chapter]
2016
Encyclopedia of Algorithms
Given an undirected graph G with m edges, n vertices, and non-negative edge weights, and given an integer k ≥ 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 This improves the O(k) query time of Thorup and Zwick. Furthermore, for any 0 < ǫ ≤ 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
doi:10.1007/978-1-4939-2864-4_568
fatcat:adaclkt7trefbokrjcxaccz3g4