Optimal-stretch name-independent compact routing in doubling metrics

DOI10.1145/1146381.1146412zbMath1314.68046OpenAlexW1981870397MaRDI QIDQ5177281

Donglin Xia, Goran Konjevod, Andréa W. Richa

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

compact routingdoubling metricsname-independent routing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (6)

Hierarchical routing over dynamic wireless networks ⋮ Additive spanners and distance and routing labeling schemes for hyperbolic graphs ⋮ On the efficiency of routing in sensor networks ⋮ Dynamic Routing and Location Services in Metrics of Low Doubling Dimension ⋮ \(k\)-chordal graphs: from cops and robber to compact routing via treewidth ⋮ Sparse covers for planar graphs and graphs that exclude a fixed minor

This page was built for publication: Optimal-stretch name-independent compact routing in doubling metrics