DMCA
FASTER ALGORITHMS FOR ALL-PAIRS APPROXIMATE SHORTEST PATHS IN UNDIRECTED GRAPHS (2006)
| Citations: | 9 - 2 self |
BibTeX
@MISC{Baswana06fasteralgorithms,
author = {Surender Baswana and Telikepalli Kavitha},
title = {FASTER ALGORITHMS FOR ALL-PAIRS APPROXIMATE SHORTEST PATHS IN UNDIRECTED GRAPHS },
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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 iff δ(u, v) ≤ ˆ δ(u, v) ≤ t · δ(u, v). Computing all-pairs small stretch distances efficiently (both in terms of time and space) is a well-studied problem in graph algorithms. We present a simple, novel and generic scheme for all-pairs approximate shortest paths. Using this scheme and some new ideas and tools, we design faster algorithms for all-pairs t-stretch distances for a whole range of stretch t, and also answer an open question posed by Thorup and Zwick in their
