arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.3099cs.DC
收藏

超快速3-规则集

Super-Fast 3-Ruling Sets

Kishore Kothapalli, Sriram Pemmaraju

摘要:

图$G = (V, E)$的$t$ -规则集是一个独立的顶点子集$S \subseteq V$,它满足每个顶点$v \in V$与$S$中某个顶点的距离不超过$t$的性质. \textit{maximal independent set (MIS)}是1-规则集。在网络上计算MIS的问题是分布式算法中的一个基本问题,解决这个问题的最快算法是25年前由Luby(SICOMP 1986)和Alon等人(J. Algorithms 1986)提出的$O(\log n)$轮算法。从那时起,这个问题已经抵制了所有的努力,以产生一个子对数算法。最近在这个问题上取得了一些进展,最重要的是Barenboim等人提出了一种在具有$n$顶点和最大度$Δ$的图上的$O(\log Δ\cdot \sqrt{\log n})$ -轮算法(Barenboim,Elkin,Pettie,and Schneider,April 2012,arxiv 1202.1983; to appear FOCS 2012)。我们从一个不同的角度来处理MIS问题,并询问O(1)-规则集是否可以比MIS更有效地计算?作为这个问题的答案,我们展示了如何在$O((\log n)^{3/4})$轮中计算$n$ -顶点图的2-裁决集。我们还表明,上述结果可以改进的特殊类的图,如图与高围长,树,和图的有界荫度。我们的主要技术包括随机稀疏化,快速降低图的度,同时确保每个删除的顶点接近一些顶点,仍然。该技术可以在其他上下文中具有进一步的应用,例如,设计亚对数分布近似算法。我们的研究结果提出了有趣的问题,如何快速的MIS(或1-统治集)可以计算,鉴于2-统治集可以计算在次对数轮。

英文摘要:

A $t$-ruling set of a graph $G = (V, E)$ is a vertex-subset $S \subseteq V$ that is independent and satisfies the property that every vertex $v \in V$ is at a distance of at most $t$ from some vertex in $S$. A \textit{maximal independent set (MIS)} is a 1-ruling set. The problem of computing an MIS on a network is a fundamental problem in distributed algorithms and the fastest algorithm for this problem is the $O(\log n)$-round algorithm due to Luby (SICOMP 1986) and Alon et al. (J. Algorithms 1986) from more than 25 years ago. Since then the problem has resisted all efforts to yield to a sub-logarithmic algorithm. There has been recent progress on this problem, most importantly an $O(\log Δ\cdot \sqrt{\log n})$-round algorithm on graphs with $n$ vertices and maximum degree $Δ$, due to Barenboim et al. (Barenboim, Elkin, Pettie, and Schneider, April 2012, arxiv 1202.1983; to appear FOCS 2012). We approach the MIS problem from a different angle and ask if O(1)-ruling sets can be computed much more efficiently than an MIS? As an answer to this question, we show how to compute a 2-ruling set of an $n$-vertex graph in $O((\log n)^{3/4})$ rounds. We also show that the above result can be improved for special classes of graphs such as graphs with high girth, trees, and graphs of bounded arboricity. Our main technique involves randomized sparsification that rapidly reduces the graph degree while ensuring that every deleted vertex is close to some vertex that remains. This technique may have further applications in other contexts, e.g., in designing sub-logarithmic distributed approximation algorithms. Our results raise intriguing questions about how quickly an MIS (or 1-ruling sets) can be computed, given that 2-ruling sets can be computed in sub-logarithmic rounds.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑