Distributed construction of lightweight spanners for unit ball graphs.
D. Eppstein and
H. Khodabandeh.
arXiv:2106.15234.
Brief
announcement, 34th ACM Symposium on Parallelism in Algorithms and
Architectures, 2022, pp. 57–59, doi:10.1145/3490148.3538553.
Proc. 36th International Symposium on Distributed Computing (DISC
2022).
Leibniz International
Proceedings in Informatics (LIPIcs) 246, 2022,
pp. 21:1–21:23, doi:10.4230/LIPIcs.DISC.2022.21.
Metric spaces of bounded doubling dimension have spanners with bounded degree, weight a bounded multiple of the minimum spanning tree weight, and dilation arbitrarily close to one, that can be found efficiently by a distributed algorithm.
(Blog post: Spanners for unit ball graphs in doubling spaces)