Near-Optimal Distributed Routing with Low Memory

DOI10.1145/3212734.3212761zbMath1428.68373OpenAlexW2810930637MaRDI QIDQ5197685

Ofer Neiman, Michael Elkin

Publication date: 19 September 2019

Published in: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

compact routingCongest

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items

Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs, Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC