Distributed Lower Bounds for Ruling Sets

@article{Balliu2020DistributedLB,
  title={Distributed Lower Bounds for Ruling Sets},
  author={Alkida Balliu and Sebastian Brandt and Dennis Olivetti},
  journal={2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)},
  year={2020},
  pages={365-376}
}
  • A. Balliu, S. Brandt, D. Olivetti
  • Published 17 April 2020
  • Computer Science
  • 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
Given a graph <tex>$G=(V, E)$</tex>, an (<tex>$\alpha,\beta$</tex>) -ruling set is a subset <tex>$S\subseteq V$</tex> such that the distance between any two vertices in <tex>$S$</tex> is at least <tex>$\alpha$</tex>, and the distance between any vertex in <tex>$V$</tex> and the closest vertex in <tex>$S$</tex> is at most <tex>$\beta$</tex>. We present lower bounds for distributedly computing ruling sets. More precisely, for the problem of computing a (<tex>$2, \beta$</tex>) - ruling set (and… 

Figures from this paper

Distributed ∆-coloring plays hide-and-seek
TLDR
Lower bounds as a function of Δ are proved for a large class of distributed symmetry breaking problems, which can all be solved by a simple sequential greedy algorithm, including the maximal independent set (MIS) in trees.
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees
TLDR
This work proves lower bounds for a much more relaxed family of distributed symmetry breaking problems and provides a novel way to do simplifications for round elimination, which is expected to be of independent interest.
On Relaxation of Dominant Sets
TLDR
The algorithm succeeds for ( α, α − 1) ruling sets in which α > 1, for which constraints exist on the proximity of vertices v ∈ S .
Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees
TLDR
It is shown that a local problem admits a continuous solution if and only if it admits a local algorithm with local complexity O (log ∗ n ) , and a Baire measurable solution is admitted if andonly if it admitting a local algorithms with local simplicity O ( log n ) .
Deterministic Distributed algorithms and Descriptive Combinatorics on \Delta-regular trees
TLDR
It is shown that a local problem admits a continuous solution if and only if it admits a local algorithm with local complexity O (log ∗ n ) , and a Baire measurable solution is admitted if andonly if it admitting a local algorithms with local simplicity O ( log n ) .
Efficient Classification of Local Problems in Regular Trees
We give practical, efficient algorithms that automatically determine the distributed round complexity of a given locally checkable graph problem, in two settings. We present one algorithm for
The Landscape of Distributed Complexities on Trees and Beyond
TLDR
The main contribution is to complete the classification of the complexity landscape of LCL problems on trees in the LOCAL model, by proving that every LCL problem with local complexity o (log* n) has actually complexityO(1), which improves upon the previous speedup result.
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics
TLDR
This approach that borrows techniques from the fields (a), (b) and (c) implies a number of results about possible complexities of finitary factor solutions and helps to view all three perspectives as a part of a common theory of locality.
Improved Distributed Fractional Coloring Algorithms
TLDR
The fractional coloring problem can be approximated arbitrarily well by an efficient algorithm in the LOCAL model, and it is shown that in regular grids of bounded dimension, a fractional (2 + ε )-coloring can be computed in time O (log ∗ n ).
Distributed $\Delta$-Coloring Plays Hide-and-Seek
TLDR
Lower bounds as a function of ∆ are proved for a large class of distributed symmetry breaking problems, which can all be solved by a simple sequential greedy algorithm.
...
...

References

SHOWING 1-10 OF 57 REFERENCES
Polylogarithmic-time deterministic network decomposition and distributed derandomization
TLDR
A simple polylogarithmic-time deterministic distributed algorithm for network decomposition that improves on a celebrated 2 O(√logn)-time algorithm and settles a central and long-standing question in distributed graph algorithms.
Distributed Graph Coloring
Deterministic Distributed Ruling Sets of Line Graphs
An $(\alpha,\beta)$-ruling set of a graph $G=(V,E)$ is a set $R\subseteq V$ such that for any node $v\in V$ there is a node $u\in R$ in distance at most $\beta$ from $v$ and such that any two nodes
An Improved Distributed Algorithm for Maximal Independent Set
TLDR
A very simple randomized algorithm providing a near-optimal local complexity of O(log deg(v) + log 1/e) rounds, with probability at least 1, which incidentally, when combined with some known techniques, also leads to a near -optimal global complexity.
The Locality of Distributed Symmetry Breaking
TLDR
New bounds on the locality of several classical symmetry breaking tasks in distributed networks are presented and a new technique for reducing symmetry breaking problems on low arboricity graphs to low degree graphs is introduced.
Lower Bounds for Maximal Matchings and Maximal Independent Sets
TLDR
It follows that there is no deterministic algorithm for maximal matchings or maximal independent sets that runs in o(Δ + log n / log log n) rounds; this is an improvement over prior lower bounds also as a function of n.
Distributed Computing: A Locality-Sensitive Approach
Locality in Distributed Graph Algorithms
  • N. Linial
  • Mathematics, Computer Science
    SIAM J. Comput.
  • 1992
TLDR
This model focuses on the issue of locality in distributed processing, namely, to what extent a global solution to a computational problem can be obtained from locally available data.
A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring
  • M. Naor
  • Computer Science
    SIAM J. Discret. Math.
  • 1991
TLDR
It is shown that any probabilistic algorithm for 3 coloring the ring must take at least $\frac{1}{2}\log^* n - 2$ rounds, otherwise the probability that all processors are colored legally is less than $1$.
MIS on trees
TLDR
This paper presents a solution with randomized running time O(√log n log log n) on trees, improving roughly quadratically on the state-of-the-art bound, and does not rely on any bound on the number of independent neighbors.
...
...