@inproceedings{3f31eb6c22524eeda9402478adcd2f8e,

title = "Approximate distance oracles for graphs with dense clusters",

abstract = "Let TeX be a collection of N pairwise vertex disjoint TeX -spanners where the weight of an edge is equal to the Euclidean distance between its endpoints. Let TeX be a graph on TeX with M edges of non-negative weight. The union of the two graphs is denoted TeX . We present a data structure of size TeX that answers (1+e)-approximate shortest path queries in TeX in constant time, where e>¿0 is constant.",

author = "M. Andersson and C. Levcopoulos and J. Gudmundsson",

year = "2004",

doi = "10.1007/978-3-540-30551-4_7",

language = "English",

isbn = "3-540-24131-0",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "53--64",

editor = "R. Fleischer and G. Trippen",

booktitle = "Algorithms and Computation (Proceedings 15th International Symposium, ISAAC 2004, Hong Kong, December 20-22, 2004)",

address = "Germany",

}