A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Distance Oracles for Sparse Graphs

2009
*
2009 50th Annual IEEE Symposium on Foundations of Computer Science
*

Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer k, they showed an efficient algorithm to construct an approximate distance oracle using space O(kn 1+1/k ) that can answer queries in time O(k) with a distance estimate that is at most α = 2k − 1 times larger than the actual shortest distance (α is called the stretch). They proved that, under a combinatorial conjecture, their

doi:10.1109/focs.2009.27
dblp:conf/focs/SommerVY09
fatcat:deu5xejmezb7xcnd7qp7j7lshy