Compact routing on euclidian metrics
From MaRDI portal
Publication:5501493
DOI10.1145/1011767.1011789zbMath1321.68015OpenAlexW2172213884MaRDI QIDQ5501493
Publication date: 3 August 2015
Published in: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1011767.1011789
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Distributed systems (68M14)
Related Items (7)
Local routing algorithms on Euclidean spanners with small diameter ⋮ Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs ⋮ Distance estimation and object location via rings of neighbors ⋮ On the efficiency of routing in sensor networks ⋮ Small hop-diameter sparse spanners for doubling metrics ⋮ Low-light trees, and tight lower bounds for Euclidean spanners ⋮ Local routing in a tree metric \(1\)-spanner
This page was built for publication: Compact routing on euclidian metrics
