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

@article{Balliu2021ImprovedDL,
  title={Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees},
  author={Alkida Balliu and Sebastian Brandt and Fabian Kuhn and Dennis Olivetti},
  journal={Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing},
  year={2021}
}
  • A. Balliu, S. Brandt, D. Olivetti
  • Published 4 June 2021
  • Computer Science, Mathematics
  • Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing
Recently, Balliu, Brandt, and Olivetti [FOCS '20] showed the first ω(log n) lower bound for the maximal independent set (MIS) problem in trees. In this work we prove lower bounds for a much more relaxed family of distributed symmetry breaking problems. As a by-product, we obtain improved lower bounds for the distributed MIS problem in trees. For a parameter k and an orientation of the edges of a graph G, we say that a subset S of the nodes of G is a k-outdegree dominating set if S is a… 

Figures from this paper

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.
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.
Locally Checkable Labelings with Small Messages
TLDR
The landscape of LCL complexities under bandwidth restrictions is studied, showing that on trees, the CONGEST complexity of an LCL problem is asymptotically equal to its complexity in the LOCAL model, and for general graphs this equivalence does not hold.
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.
Sleeping is Superefficient: MIS in Exponentially Better Awake Complexity
TLDR
The results show that an MIS in an awake complexity that is exponentially better compared to the best known round complexity of O (log n ) in the traditional model and bypassing its Ω ( cid:16)q log n loglog n (cid:17) lower bound.
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 ) .

References

SHOWING 1-10 OF 45 REFERENCES
A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
TLDR
The algorithm shows that for computing a MIS, randomization is a viable alternative to distance information and is close to optimal.
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.
Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants
TLDR
This work provides truly tight bounds in Δ for the complexity of bipartite maximal matching and many natural variants, up to and including the additive constant in the LOCAL model.
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.
Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
TLDR
The first sublogarithmic algorithm for computing an MIS on graphs of bounded arboricity is devised, which demonstrates that this methodology is very powerful and shows nearly-tight lower bounds on the running time of any distributed algorithms for computing a forests-decomposition.
Hardness of Minimal Symmetry Breaking in Distributed Computing
TLDR
It is shown that weak 2-coloring is a minimal distributed symmetry-breaking problem for regular even-degree trees and high-girth graphs, and a tight lower bound of Ω(log ⋅ n) is proved for the distributed computational complexity of weak 2 -coloring in regular trees.
On the complexity of local distributed graph problems
TLDR
The result can be viewed as showing that the only obstacle to getting efficient determinstic algorithms in the LOCAL model is an efficient algorithm to approximately round fractional values into integer values.
On the Complexity of Distributed Network Decomposition
In this paper, we improve the bounds for computing a network decomposition distributively and deterministically. Our algorithm computes an (n?(n),n?(n))-decomposition innO(?(n))time, whereformula. As
An Automatic Speedup Theorem for Distributed Problems
  • S. Brandt
  • Computer Science, Mathematics
    PODC
  • 2019
TLDR
A first application of the generalized speedup technique is solved, showing that weak 2-coloring in odd-degree graphs cannot be solved in o(łog^* Δ) rounds, thereby providing a matching lower bound to their upper bound.
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.
...
...