The Sparsest Additive Spanner via Multiple Weighted BFS Trees

11/05/2018
by   Keren Censor-Hillel, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2021

Fast Construction of 4-Additive Spanners

A k-additive spanner of a graph is a subgraph that preserves the distanc...
research
03/17/2021

On additive spanners in weighted graphs with local error

An additive +β spanner of a graph G is a subgraph which preserves distan...
research
06/02/2021

Ultra-Sparse Near-Additive Emulators

Near-additive (aka (1+ϵ,β)-) emulators and spanners are a fundamental gr...
research
05/07/2019

Distributed Construction of Light Networks

A t- spanner H of a weighted graph G=(V,E,w) is a subgraph that approxim...
research
04/19/2021

Minimizing the total weighted pairwise connection time in network construction problems

It is required to find an optimal order of constructing the edges of a n...
research
07/25/2019

Fast Deterministic Constructions of Linear-Size Spanners and Skeletons

In the distributed setting, the only existing constructions of sparse sk...
research
02/11/2021

Multi-level Weighted Additive Spanners

Given a graph G = (V,E), a subgraph H is an additive +β spanner if _H(u,...

Please sign up or login with your details

Forgot password? Click here to reset