## Approximate Distance Oracles (2001)

### Cached

### Download Links

- [graal.ens-lyon.fr]
- [www.cs.tau.ac.il]
- [www.cs.tau.ac.il]
- [www.cs.tau.ac.il]
- [www.cs.tau.ac.il]
- DBLP

### Other Repositories/Bibliography

Citations: | 213 - 9 self |

### BibTeX

@INPROCEEDINGS{Thorup01approximatedistance,

author = {Mikkel Thorup and Uri Zwick},

title = {Approximate Distance Oracles},

booktitle = {},

year = {2001},

pages = {183--192},

publisher = {}

}

### Years of Citing Articles

### OpenURL

### 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.