Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs

@article{Baswana2010FasterAF,
  title={Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs},
  author={Surender Baswana and Telikepalli Kavitha},
  journal={SIAM J. Comput.},
  year={2010},
  volume={39},
  pages={2865-2896}
}
Let $G=(V,E)$ be a weighted undirected graph having nonnegative edge weights. An estimate $\hat{\delta}(u,v)$ of the actual distance $\delta(u,v)$ between $u,v\in V$ is said to be of stretch $t$ if and only if $\delta(u,v)\leq\hat{\delta}(u,v)\leq t\cdot\delta(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… CONTINUE READING

Citations

Publications citing this paper.