On Efficient Distributed Construction of Near Optimal Routing Schemes

DOI10.1145/2933057.2933098zbMath1373.68041OpenAlexW2476434590MaRDI QIDQ5361941

Michael Elkin, Ofer Neiman

Publication date: 29 September 2017

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

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

zbMATH Keywords

routingcongest model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (5)

Distributed distance computation and routing with small messages ⋮ Routing schemes for hybrid communication networks ⋮ On efficient distributed construction of near optimal routing schemes ⋮ Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths ⋮ Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC

This page was built for publication: On Efficient Distributed Construction of Near Optimal Routing Schemes