Sparse communication networks and efficient routing in the plane (extended abstract)

DOI10.1145/343477.343514zbMath1314.68025MaRDI QIDQ5176770

Yehuda Hassin, David Peleg

Publication date: 3 March 2015

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

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

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B18: Communication networks in operations research

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

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

05C85: Graph algorithms (graph-theoretic aspects)

68M12: Network protocols

Related Items

Truly Optimal Euclidean Spanners, Compact and localized distributed data structures, Light Euclidean Spanners with Steiner Points, Low-light trees, and tight lower bounds for Euclidean spanners