Approximate distance oracles

759 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Fast shortest path distance estimation in large networks (2009, background): “Thorup and Zwick [32] observe that this problem is probably the most natural formulation of the APSP.”
New constructions of (α, β)-spanners and purely additive spanners (2005, background): “Thorup and Zwick [TZ01a] introduced the idea of an approximate distance oracle, a compact data structure of size O(n) that answers distance queries in constant time to within a multiplicative error of 2k − 1.”
Fast construction of nets in low dimensional metrics, and their applications (2004, neutral): “For a point p ∈ M and a number r ≥ 0, we denote by b(p, r) = {q ∈M| dM(p, q) ≤ r} the closed ball of radius r around p.”
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks (2011, background): “Labeling algorithms have been studied before in the distributed computing literature [15, 30].”