Distributed Lower Bounds for Ruling Sets

04/17/2020
by   Alkida Balliu, et al.
0

Given a graph G = (V,E), an (α, β)-ruling set is a subset S ⊆ V such that the distance between any two vertices in S is at least α, and the distance between any vertex in V and the closest vertex in S is at most β. We present lower bounds for distributedly computing ruling sets. The results carry over to one of the most fundamental symmetry breaking problems, maximal independent set (MIS), as MIS is the same as a (2,1)-ruling set. More precisely, for the problem of computing a (2, β)-ruling set (and hence also any (α, β)-ruling set with α > 2) in the LOCAL model of distributed computing, we show the following, where n denotes the number of vertices and Δ the maximum degree. ∙ There is no deterministic algorithm running in o( logΔ/βloglogΔ) + o(√(log n/βloglog n)) rounds, for any β∈ o(√(logΔ/loglogΔ)) + o((log n/loglog n)^1/3). ∙ There is no randomized algorithm running in o( logΔ/βloglogΔ) + o(√(loglog n/βlogloglog n)) rounds, for any β∈ o(√(logΔ/loglogΔ)) + o((loglog n/logloglog n)^1/3). For β > 1, this improves on the previously best lower bound of Ω(log^* n) rounds that follows from the old bounds of Linial [FOCS'87] and Naor [J.Disc.Math.'91] (resp. Ω(1) rounds if β∈ω(log^* n)). For β = 1, i.e., for MIS, our results improve on the previously best lower bound of Ω(log^* n)on trees, as our bounds already hold on trees.

READ FULL TEXT

page 1

page 2

page 3

page 4

01/08/2019

Lower bounds for maximal matchings and maximal independent sets

There are distributed graph algorithms for finding maximal matchings and...
08/01/2019

Distributed Data Summarization in Well-Connected Networks

We study distributed algorithms for some fundamental problems in data su...
02/14/2020

A Breezing Proof of the KMW Bound

In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW...
05/18/2018

Deterministic Distributed Ruling Sets of Line Graphs

An (α,β)-ruling set of a graph G=(V,E) is a set R⊆ V such that for any n...
07/18/2019

Very fast construction of bounded-degree spanning graphs via the semi-random graph process

Semi-random processes involve an adaptive decision-maker, whose goal is ...
06/04/2021

Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees

Recently, Balliu, Brandt, and Olivetti [FOCS '20] showed the first ω(log...
03/16/2020

Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST

By far the most fruitful technique for showing lower bounds for the CONG...