Abstract
Given a graph G = (V,E) with non-negative edge lengths whose vertices are assigned a label from L = {λ 1,…,λ ℓ}, we construct a compact distance oracle that answers queries of the form: “What is δ(v,λ)?”, where v ∈ V is a vertex in the graph, λ ∈ L a vertex label, and δ(v,λ) is the distance (length of a shortest path) between v and the closest vertex labeled λ in G. We formalize this natural problem and provide a hierarchy of approximate distance oracles that require subquadratic space and return a distance of constant stretch. We also extend our solution to dynamic oracles that handle label changes in sublinear time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baswana, S., Gaur, A., Sen, S., Upadhyay, J.: Distance oracles for unweighted graphs: Breaking the quadratic barrier with constant additive error. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 609–621. Springer, Heidelberg (2008)
Baswana, S., Kavitha, T.: Faster algorithms for approximate distance oracles and all-pairs small stretch paths. In: Proc. of the 47th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 591–602 (2006)
Erdős, P.: Extremal problems in graph theory. Theory of graphs and its applications, 29–36 (1964)
Matoušek, J.: On the distortion required for embedding finite metric spaces into normed spaces. Israel Journal of Mathematics (93), 333–344 (1996)
Pǎtraşcu, M., Roditty, L.: Distance oracles beyond the thorup-zwick bound. In: Proc. of the 51st annual symposium on Foundations Of Computer Science (FOCS), pp. 815–823 (2010)
Roditty, L., Thorup, M., Zwick, U.: Deterministic constructions of approximate distance oracles and spanners. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 261–272. Springer, Heidelberg (2005)
Sommer, C., Verbin, E., Yu, W.: Distance oracles for sparse graphs. In: Proc. of the 50th IEEE Symposium on Foundation of Computer Science (FOCS), pp. 703–712 (2009)
Thorup, M., Zwick, U.: Compact routing schemes. In: Proc. of the 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 1–10 (2001)
Thorup, M., Zwick, U.: Approximate distance oracles. Journal of the ACM 52(1), 1–24 (2005)
van Emde Boas, P., Kaas, R., Ziljstra, E.: Design and implementation of an effcient priority queue. Mathematical Systems Theory 10, 99–127 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hermelin, D., Levy, A., Weimann, O., Yuster, R. (2011). Distance Oracles for Vertex-Labeled Graphs. In: Aceto, L., Henzinger, M., Sgall, J. (eds) Automata, Languages and Programming. ICALP 2011. Lecture Notes in Computer Science, vol 6756. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22012-8_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-22012-8_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22011-1
Online ISBN: 978-3-642-22012-8
eBook Packages: Computer ScienceComputer Science (R0)