On Hierarchical Routing in Doubling Metrics

DOI10.1145/2915183zbMath1445.68108OpenAlexW3137290582MaRDI QIDQ4962632

Bruce M. Maggs, Shuheng Zhou, T.-H. Hubert Chan, Anupam Gupta

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2915183

zbMATH Keywords

spannershierarchical routingdoubling metrics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14)

Related Items (10)

Truly Optimal Euclidean Spanners ⋮ Near isometric terminal embeddings for doubling metrics ⋮ Demand-aware network designs of bounded degree ⋮ Local routing algorithms on Euclidean spanners with small diameter ⋮ Vertex Fault-Tolerant Geometric Spanners for Weighted Points ⋮ Light Euclidean Spanners with Steiner Points ⋮ Bounded-degree light approximate shortest-path trees in doubling metrics ⋮ The Greedy Spanner Is Existentially Optimal ⋮ Local routing in a tree metric \(1\)-spanner ⋮ Near Isometric Terminal Embeddings for Doubling Metrics

This page was built for publication: On Hierarchical Routing in Doubling Metrics