Abstract
Let G be a geometric t-spanner in Ed with n vertices and m edges, where t is a constant. We show that G can be preprocessed in O(m log n) time, such that (1 + ε)-approximate shortest-path queries in G can be answered in O(1) time. The data structure uses O(nlogn) space. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
APA
Gudmundsson, J., Levcopoulos, C., Narasimhan, G., & Smid, M. (2002). Approximate distance oracles revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2518 LNCS, pp. 357–368). https://doi.org/10.1007/3-540-36136-7_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free