Distributed Lovász Local Lemma under Bandwidth Limitations
CoRR(2024)
摘要
The constructive Lovász Local Lemma has become a central tool for
designing efficient distributed algorithms. While it has been extensively
studied in the classic LOCAL model that uses unlimited bandwidth, much less is
known in the bandwidth-restricted CONGEST model.
In this paper, we present bandwidth- and time-efficient algorithms for
various subclasses of LLL problems, including a large class of subgraph
sampling problems that are naturally formulated as LLLs. Lastly, we use our
LLLs to design efficient CONGEST algorithms for coloring sparse and
triangle-free graphs with few colors. These coloring algorithms are
exponentially faster than previous LOCAL model algorithms.
更多查看译文
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要