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

DOI10.1145/343477.343514zbMath1314.68025OpenAlexW1970732121MaRDI 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

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Network protocols (68M12)

Related Items (4)

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

This page was built for publication: Sparse communication networks and efficient routing in the plane (extended abstract)