Living Reference Work Entry

Encyclopedia of Algorithms

pp 1-4

Date: Latest Version

Approximate Distance Oracles with Improved Query Time

  • Christian Wulff-NilsenAffiliated withDepartment of Computer Science, University of Copenhagen Email author 


Approximate distance oracle Shortest paths Graphs Query time

Years and Authors of Summarized Original Work

2013; Wulff-Nilsen

Problem Definition

This problem is concerned with obtaining a compact data structure capable of efficiently reporting approximate shortest path distance queries in a given undirected edge-weighted graph G = (V, E). If the query time is independent (or nearly independent) of the size of G, we refer to the data structure as an approximate distance oracle for G. For vertices u and v in G, we denote by dG(u, v) the shortest path distance between u and v in G. For a given stretch parameter δ ≥ 1, we call the oracle δ-approximate if for all vertices u and v in G, ...

This is an excerpt from the content