Ultra-Sparse Near-Additive Emulators

  title={Ultra-Sparse Near-Additive Emulators},
  author={Michael Elkin and Shaked Matar},
  journal={Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing},
  • Michael Elkin, Shaked Matar
  • Published 2 June 2021
  • Computer Science
  • Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing
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(n^1+1/κ ) edges, with… 
1 Citations

Figures from this paper

Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model
This work presents a deterministic algorithm which solves any problem on a sparse n-node graph in Õ( √ n) rounds of HYBRID, and proves via a reduction from the set disjointness problem that Ω̃(n1/3) rounds are required to determine the radius of an unweighted graph, as well as a (3/2 − ε)-approximation for weighted graphs.


Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time
An efficient deterministic CONGEST-model algorithm for constructing arbitrarily sparse near-additive spanners and its parameters are at the same ballpark as the respective parameters of the state-of-the-art randomized algorithm due to [25].
A Hierarchy of Lower Bounds for Sublinear Additive Spanners
The lower bound simplifies Hesse's (2003) refutation of Thorup's conjecture (1992), which stated that adding a linear number of shortcuts suffices to reduce the diameter to polylogarithmic.
Parallel approximate undirected shortest paths via low hop emulators
A (1+ε)-approximate parallel algorithm for computing shortest paths in undirected graphs, achieving poly(logn) depth and m poly( logn) work for n-nodes m-edges graphs, and improves the state-of-the-art sequential running time.
Subgraph sparsification and nearly optimal ultrasparsifiers
It is shown that for each positive integer k, every n-vertex weighted graph has an (n-1+k)-edge spectral sparsifier with relative condition number at most n/k log n, ~O(log log n) where ~O() hides lower order terms.
Solving SDD linear systems in nearly mlog1/2n time
This work shows that preconditioners constructed by random sampling can perform well without meeting the standard requirements of iterative methods, and obtains a two-pass approach algorithm for constructing optimal embeddings in snowflake spaces that runs in O(m log log n) time.
The 4/3 additive spanner exponent is tight
A new information theoretic incompressibility bound is shown: there is no function that compresses graphs into O(n4/3 − ε) bits so that distance information can be recovered within +no(1) error.
Efficient algorithms for constructing (1+∊,β)-spanners in the distributed and streaming models
A protocol with a drastically improved running time (O(n^ρ) as opposed to O(n1+ρ)) for constructing (1+∊,β)-spanners and it constructs spanners with essentially the same properties as the spanners that are constructed by the protocol of [19].
Fast Partial Distance Estimation and Applications
A randomized O(k)-approximation to APSP, for any integer k>1, running in time ~O(n1/2+1/k+D) rounds, where D is the hop diameter of the network and the new algorithm uses O(log n)-bit labels, which is asymptotically optimal.
Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths
  • Michael Elkin, Ofer Neiman
  • Computer Science, Mathematics
    2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2016
The first construction of sparse hopsets with a constant number of hops is exhibited, and the applicability of the results for the fundamental problem of computing approximate shortest paths from s sources is demonstrated.
Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts
We prove better lower bounds on additive spanners and emulators, which are lossy compression schemes for undirected graphs, as well as lower bounds on shortcut sets, which reduce the diameter of