Distributed Lower Bounds for Ruling Sets

FOCS, pp. 365-376, 2020.

Cited by: 0|Bibtex|Views31|DOI:https://doi.org/10.1109/FOCS46700.2020.00042
EI
Other Links: arxiv.org|dblp.uni-trier.de

Abstract:

Given a graph $G = (V,E)$, an $(\alpha, \beta)$-ruling set is a subset $S \subseteq V$ such that the distance between any two vertices in $S$ is at least $\alpha$, and the distance between any vertex in $V$ and the closest vertex in $S$ is at most $\beta$. We present lower bounds for distributedly computing ruling sets. The results carr...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments