Fast routing table construction using small messages

DOI10.1145/2488608.2488656zbMath1293.68058MaRDI QIDQ5495808

Boaz Patt-Shamir, Christoph Lenzen

Publication date: 7 August 2014

Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

routing; approximate shortest paths; small messages

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68M14: Distributed systems

68W20: Randomized algorithms

68W15: Distributed algorithms