The sparsest additive spanner via multiple weighted BFS trees
From MaRDI portal
Publication:2201997
DOI10.1016/j.tcs.2020.05.035zbMath1461.68146arXiv1811.01997OpenAlexW2952039123MaRDI QIDQ2201997
Ami Paz, Noam Ravid, Keren Censor-Hillel
Publication date: 17 September 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.01997
Related Items (2)
Cites Work
- Fast deterministic distributed algorithms for sparse spanners
- Matching is as easy as matrix inversion
- A fast network-decomposition algorithm and its applications to constant-time distributed computation
- Near-linear lower bounds for distributed distance computations, even in sparse networks
- Vertex fault tolerant additive spanners
- New pairwise spanners
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- Distributed distance computation and routing with small messages
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
- Optimal distributed all pairs shortest paths and applications
- On the locality of distributed sparse spanner construction
- Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality
- Improved Distributed Approximate Matching
- Additive Spanners: A Simple Construction
- Additive spanners and (α, β)-spanners
- Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
- Additive Spanners in Nearly Quadratic Time
- Local Computation of Nearly Additive Spanners
- Graph spanners
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Distributed Computing: A Locality-Sensitive Approach
- Error Amplification for Pairwise Spanner Lower Bounds
- Efficient Algorithms for Constructing Very Sparse Spanners and Emulators
- The 4/3 Additive Spanner Exponent Is Tight
- A trade-off between space and efficiency for routing tables
- An Optimal Synchronizer for the Hypercube
- Distributed Verification and Hardness of Distributed Approximation
- Distributed exact shortest paths in sublinear time
- Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set
- Congested Clique Algorithms for Graph Spanners
- Compact routing schemes with improved stretch
- Efficient distributed source detection with limited bandwidth
- Distributed Spanner Approximation
- A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds
- Distributed exact weighted all-pairs shortest paths in near-linear time
- Improved distributed algorithms for exact shortest paths
- Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths
- Distributed approximation algorithms for weighted shortest paths
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
- A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
- Global computation in a poorly connected world
- Computing almost shortest paths
- Distributed construction of purely additive spanners
- Distributed algorithms for ultrasparse spanners and linear size skeletons
This page was built for publication: The sparsest additive spanner via multiple weighted BFS trees
