DMCA
All Pairs Almost Shortest Paths (1996)
Cached
Download Links
- [www.cs.tau.ac.il]
- [www.cs.tau.ac.il]
- [www.math.tau.ac.il]
- DBLP
Other Repositories/Bibliography
| Venue: | SIAM Journal on Computing |
| Citations: | 91 - 7 self |
BibTeX
@ARTICLE{Dor96allpairs,
author = {Dorit Dor and Shay Halperin and Uri Zwick},
title = {All Pairs Almost Shortest Paths},
journal = {SIAM Journal on Computing},
year = {1996},
volume = {29},
pages = {452--461}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Let G = (V; E) be an unweighted undirected graph on n vertices. A simple argument shows that computing all distances in G with an additive one-sided error of at most 1 is as hard as Boolean matrix multiplication. Building on recent work of Aingworth, Chekuri and Motwani, we describe g) time algorithm APASP 2 for computing all distances in G with an additive one-sided error of at most 2. The algorithm APASP 2 is simple, easy to implement, and faster than the fastest known matrix multiplication algorithm. Furthermore, for every even k ? 2, we describe an g) time algorithm APASP k for computing all distances in G with an additive one-sided error of at most k.
