@inproceedings{9fdda9a190aa4be08a5d91194a6582b7,
title = "Approximate distance oracles with improved bounds",
abstract = "A distance oracle is a compact data structure capable of quickly estimating distances in a given graph. In this paper we provide a new construction for distance oracles in general undirected weighted graphs. Our data structure, for any integer k, requires O (n1+1/k) space, guarantees a stretch of 2k-1, and answers any query in only O(1) time.",
keywords = "Constant querytime, Distance oracles, Shortest paths",
author = "Shiri Chechik",
note = "Publisher Copyright: {\textcopyright} Copyright 2015 ACM.; 47th Annual ACM Symposium on Theory of Computing, STOC 2015 ; Conference date: 14-06-2015 Through 17-06-2015",
year = "2015",
month = jun,
day = "14",
doi = "10.1145/2746539.2746562",
language = "الإنجليزيّة",
series = "Proceedings of the Annual ACM Symposium on Theory of Computing",
publisher = "Association for Computing Machinery",
pages = "1--10",
booktitle = "STOC 2015 - Proceedings of the 2015 ACM Symposium on Theory of Computing",
address = "الولايات المتّحدة",
}