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
2001
Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k ≥ 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn 1/k ) expected time, constructing a data structure of size O(kn 1+1/k ), such that any subsequent distance query can be answered, approximately, in O(k) time. The approximate distance returned is of stretch at most 2k − 1, i.e., the quotient obtained by dividing the estimated distance by the actual distance lies between 1 and 2k −1. A 1963 girth
doi:10.1145/380752.380798
dblp:conf/stoc/ThorupZ01
fatcat:wvffmpvwnnc5rfsnx2yljzklli