Approximate Distance Oracles

Approximate Distance Oracles (2001)

by Mikkel Thorup , Uri Zwick

Citations:

154 - 6 self

User correction supplied by mph

Datum	Value	Source
TITLE	Approximate Distance Oracles	user correction - Legacy Corrections
AUTHOR NAME	Mikkel Thorup	user correction
AUTHOR AFFIL		user correction
AUTHOR NAME	Uri Zwick	user correction
AUTHOR AFFIL		user correction
ABSTRACT	Let G = (V; E) be an undirected weighted graph with jV j = n and jEj = m. Let k 1 be an integer. We show that G = (V; E) can be preprocessed in O(kmn ) expected time, constructing a data structure of size O(kn ), such that any subsequent distance query can be answered, approximately, in O(k) time. The approximate distance returned is of stretch at most 2k \Gamma 1, i.e., the quotient obtained by dividing the estimated distance by the actual distance lies between 1 and 2k \Gamma 1. We show that a 1963 girth conjecture of Erdos, implies ) space is needed in the worst case for any real stretch strictly smaller than 2k + 1. The space requirement of our algorithm is, therefore, essentially optimal.	user correction - Legacy Corrections
YEAR	2001	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	183--192	INFERENCE
VOLUME	52	INFERENCE
CITATIONS	57 found	ParsCit 1.0