The sparsest additive spanner via multiple weighted BFS trees
From MaRDI portal
(Redirected from Publication:2201997)
Abstract: Spanners are fundamental graph structures that sparsify graphs at the cost of small stretch. In particular, in recent years, many sequential algorithms constructing additive all-pairs spanners were designed, providing very sparse small-stretch subgraphs. Remarkably, it was then shown that the known (+6)-spanner constructions are essentially the sparsest possible, that is, a larger additive stretch cannot guarantee a sparser spanner, which brought the stretch-sparsity trade-off to its limit. Distributed constructions of spanners are also abundant. However, for additive spanners, while there were algorithms constructing (+2) and (+4)-all-pairs spanners, the sparsest case of (+6)-spanners remained elusive. We remedy this by designing a new sequential algorithm for constructing a (+6)-spanner with the essentially-optimal sparsity of roughly O(n^{4/3}) edges. We then show a distributed implementation of our algorithm, answering an open problem in [Censor-Hillel et al., DISC 2016]. A main ingredient in our distributed algorithm is an efficient construction of multiple weighted BFS trees. A weighted BFS tree is a BFS tree in a weighted graph, that consists of the lightest among all shortest paths from the root to each node. We present a distributed algorithm in the CONGEST model, that constructs multiple weighted BFS trees in |S|+D-1 rounds, where S is the set of sources and D is the diameter of the network graph.
Recommendations
Cites work
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
- A deterministic distributed algorithm for exact weighted all-pairs shortest paths in \(\tilde{O}(n^{3/2})\) rounds
- A fast network-decomposition algorithm and its applications to constant-time distributed computation
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
- A trade-off between space and efficiency for routing tables
- Additive spanners and \(({\alpha}, {\beta})\)-spanners
- Additive spanners in nearly quadratic time
- Additive spanners: a simple construction
- An Optimal Synchronizer for the Hypercube
- Compact routing schemes with improved stretch
- Computing almost shortest paths
- Congested clique algorithms for graph spanners
- Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality
- Derandomizing distributed algorithms with small messages: spanners and dominating set
- Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
- Distributed Computing: A Locality-Sensitive Approach
- Distributed Spanner Approximation
- Distributed algorithms for ultrasparse spanners and linear size skeletons
- Distributed approximation algorithms for weighted shortest paths
- Distributed distance computation and routing with small messages
- Distributed exact weighted all-pairs shortest paths in near-linear time
- Distributed verification and hardness of distributed approximation
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- Efficient algorithms for constructing very sparse spanners and emulators
- Efficient distributed source detection with limited bandwidth
- Error Amplification for Pairwise Spanner Lower Bounds
- Fast deterministic distributed algorithms for sparse spanners
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
- Global computation in a poorly connected world
- Graph spanners
- Hopsets with constant hopbound, and applications to approximate shortest paths
- Improved Distributed Approximate Matching
- Improved deterministic distributed construction of spanners
- Improved distributed algorithms for exact shortest paths
- Local Computation of Nearly Additive Spanners
- Matching is as easy as matrix inversion
- Near-linear lower bounds for distributed distance computations, even in sparse networks
- New pairwise spanners
- On the locality of distributed sparse spanner construction
- Optimal distributed all pairs shortest paths and applications
- The 4/3 additive spanner exponent is tight
Cited in
(6)- Graph spanners: a tutorial review
- An FPT Algorithm for Minimum Additive Spanner Problem.
- scientific article; zbMATH DE number 7774272 (Why is no real title available?)
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees
- Improved weighted additive spanners
- Additive sparse spanners for graphs with bounded length of largest induced cycle
This page was built for publication: The sparsest additive spanner via multiple weighted BFS trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201997)
