Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Journal of the ACM (JACM)
Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Distance Oracles for Sparse Graphs
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Distance Oracles beyond the Thorup-Zwick Bound
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Deterministic constructions of approximate distance oracles and spanners
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Improved distance oracles and spanners for vertex-labeled graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Top-K nearest keyword search on large graphs
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Given a graph G = (V,E) with non-negative edge lengths whose vertices are assigned a label from L = {λ1, . . ., λl}, 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.