Approximate distance oracles

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(kmn1/k ) expected time, constructing a data structure of size O(kn1+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

• Type: Conference
• Year: 2001
• Where: STOC
• Authors: Mikkel Thorup, Uri Zwick
• Keywords: Algorithms, STOC 2001, Subsequent Distance Query, Undirected Weighted Graph