Approximate distance oracles with constant query time
STOC(2014)
摘要
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(kn1+1/k), with 2k --- 1 stretch and O(1) query time. This improves the O(log k) 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].
更多查看译文
关键词
algorithms,nonnumerical algorithms and problems,shortest paths,distance oracles,theory,constant querytime
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络