@inproceedings{e41613c2810e468bb638e2ebc140680e,
title = "Can't See The Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners",
abstract = "Spanners for metric spaces have been extensively studied, perhaps most notably in low-dimensional Euclidean spaces - due to their numerous applications. Euclidean spanners can be viewed as means of compressing the (n2) pairwise distances of a d-dimensional Euclidean space into O(n) = Oĝ,d (n) spanner edges, so that the spanner distances preserve the original distances to within a factor of 1 + , for any > 0. Moreover, one can compute such spanners efficiently in the standard centralized and distributed settings. Once the spanner has been computed, it serves as a {"}proxy{"}overlay network, on which the computation can proceed, which gives rise to huge savings in space and other important quality measures.",
keywords = "doubling metrics, euclidean metrics, fault-tolerance, hop-diameter, metric spaces, routing schemes, spanners, tree covers",
author = "Omri Kahalon and Hung Le and Lazar Milenkovi{\'c} and Shay Solomon",
note = "Publisher Copyright: {\textcopyright} 2022 ACM.; 41st ACM Symposium on Principles of Distributed Computing, PODC 2022 ; Conference date: 25-07-2022 Through 29-07-2022",
year = "2022",
month = jul,
day = "20",
doi = "10.1145/3519270.3538414",
language = "אנגלית",
series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
publisher = "Association for Computing Machinery",
pages = "151--162",
booktitle = "PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing",
address = "ארצות הברית",
}