Can't See The Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners

Omri Kahalon, Hung Le, Lazar Milenković, Shay Solomon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationPODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
Pages151-162
Number of pages12
ISBN (Electronic)9781450392624
DOIs
StatePublished - 20 Jul 2022
Event41st ACM Symposium on Principles of Distributed Computing, PODC 2022 - Salerno, Italy
Duration: 25 Jul 202229 Jul 2022

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference41st ACM Symposium on Principles of Distributed Computing, PODC 2022
Country/TerritoryItaly
CitySalerno
Period25/07/2229/07/22

Keywords

  • doubling metrics
  • euclidean metrics
  • fault-tolerance
  • hop-diameter
  • metric spaces
  • routing schemes
  • spanners
  • tree covers

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Can't See The Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners'. Together they form a unique fingerprint.

Cite this