Distributed Construction of Light Networks

05/07/2019
by   Michael Elkin, et al.
0

A t- spanner H of a weighted graph G=(V,E,w) is a subgraph that approximates all pairwise distances up to a factor of t. The lightness of H is defined as the ratio between the weight of H to that of the minimum spanning tree. An (α,β)- Shallow Light Tree (SLT) is a tree of lightness β, that approximates all distances from a designated root vertex up to a factor of α. A long line of works resulted in efficient algorithms that produce (nearly) optimal light spanners and SLTs. Some of the most notable algorithmic applications of light spanners and SLTs are in distributed settings. Surprisingly, so far there are no known efficient distributed algorithms for constructing these objects in general graphs. In this paper we devise efficient distributed algorithms in the CONGEST model for constructing light spanners and SLTs, with near optimal parameters. Specifically, for any k> 1 and 0<ϵ<1, we show a (2k-1)·(1+ϵ)-spanner with lightness O(k· n^1/k) can be built in Õ(n^1/2+1/4k+2+D) rounds (where n=|V| and D is the hop-diameter of G). In addition, for any α>1 we provide an (α,1+O(1)/α-1)-SLT in (√(n)+D)· n^o(1) rounds. The running time of our algorithms cannot be substantially improved. We also consider spanners for the family of doubling graphs, and devise a (√(n)+D)· n^o(1) rounds algorithm in the CONGEST model that computes a (1+ϵ)-spanner with lightness ( n)/ϵ^O(1). As a stepping stone, which is interesting in its own right, we first develop a distributed algorithm for constructing nets (for arbitrary weighted graphs), generalizing previous algorithms that worked only for unweighted graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/29/2022

Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates

This paper presents efficient distributed algorithms for a number of fun...
research
08/26/2019

Low-Congestion Shortcut and Graph Parameters

The concept of low-congestion shortcuts is initiated by Ghaffari and Hae...
research
11/05/2018

The Sparsest Additive Spanner via Multiple Weighted BFS Trees

Spanners are fundamental graph structures that sparsify graphs at the co...
research
08/17/2018

Optimal Distributed Weighted Set Cover Approximation

We present a time-optimal deterministic distributed algorithm for approx...
research
05/21/2019

Parallel Reachability in Almost Linear Work and Square Root Depth

In this paper we provide a parallel algorithm that given any n-node m-ed...
research
07/31/2023

Light, Reliable Spanners

A ν-reliable spanner of a metric space (X,d), is a (dominating) graph H,...
research
08/15/2019

Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization

In the distributed backup-placement problem each node of a network has t...

Please sign up or login with your details

Forgot password? Click here to reset