@inproceedings{1bc5509c0d1a41caad9f640a5b0b020f,

title = "Approximate distance oracles with constant query time",

abstract = "An approximate distance oracle is a succinct data structure that provides fast answers to distance queries between any two nodes of a given graph. In this paper we consider approximate distance oracles for general undirected graphs with non-negative edge weights with constant query time. We present a distance oracle of size O(κn1+1/k), with 2κ-1 stretch and O(1) query time. This improves the O(log κ) query time of Wulff-Nilsen's distance oracle [SODA '13], which in turn improved the O(k) query time of Thorup and Zwick's distance oracle [J. ACM '05].",

keywords = "Constant querytime, Distance oracles, Shortest paths",

author = "Shiri Chechik",

year = "2014",

doi = "10.1145/2591796.2591801",

language = "אנגלית",

isbn = "9781450327107",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "654--663",

booktitle = "STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing",

note = "4th Annual ACM Symposium on Theory of Computing, STOC 2014 ; Conference date: 31-05-2014 Through 03-06-2014",

}