Ultra-Sparse Near-Additive Emulators

Michael Elkin, Shaked Matar

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

3 Scopus citations

Abstract

Near-additive (aka (1+ϵ,β)β-) emulators and spanners are a fundamental graph-algorithmic construct, with numerous applications for computing approximate shortest paths and related problems in distributed, streaming and dynamic settings. Known constructions of near-additive emulators enable one to trade between their sparsity (i.e., number of edges) and the additive stretch β. Specifically, for any pair of parameters ϵ >0, κ=1,2,..., one can have a (1+ϵ,β)-emulator with O(n1+1/κ ) edges, with β = łeft(\fracłog κ ϵ \right)łog κ . At their sparsest, these emulators employ c.n edges, for some constant c≥ 2. We tighten this bound, and show that in fact precisely n1+1/κ edges suffice.

Original languageEnglish
Title of host publicationPODC 2021 - Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages235-246
Number of pages12
ISBN (Electronic)9781450385480
DOIs
StatePublished - 21 Jul 2021
Event40th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2021 - Virtual, Online, Italy
Duration: 26 Jul 202130 Jul 2021

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference40th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2021
Country/TerritoryItaly
CityVirtual, Online
Period26/07/2130/07/21

Keywords

  • deterministic
  • distributed algorithms
  • emulators

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Ultra-Sparse Near-Additive Emulators'. Together they form a unique fingerprint.

Cite this