A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...