快速发出最大独立集的蜂鸣音
Beeping a Maximal Independent Set Fast
摘要:
我们采用了Ghaffari [SODA'16]的最新算法来计算ESTA模型中的最大独立集,因此它适用于明显较弱的BEEP模型。对于具有最大度$Δ$的网络,我们的算法在时间$O((\log Δ+ \log (1/ε)) \cdot \log(1/ε))$内局部终止,概率至少为$1 - ε$。修改的关键思想是用基于接收到的消息的数量的估计来替换关于传输概率的显式消息。在成功引入(和隐含使用)局部分析之后,例如,Barenboim等人[JACM'16]、Chung等人[PODC'14]、Ghaffari [SODA'16]和Halldorsson等人[PODC'15]提出的概念,我们首次在BEEP模型中研究了这一概念。通过这样做,我们改进了本地边界,隐式地从以前的工作(使用传统的全球分析)计算的最大独立集的\beep模型的参数$Δ$的值的大范围。在同一时间,我们表明,我们的算法在\beep模型只需要支付一个$\log(1/ε)$因素在运行时相比,最有名的MIS算法在更强大的\local模型。我们证明,这种开销是可以忽略不计的,通过哔哔声通信可以实现使用显着较少的资源比通信中的ESTA模型。特别是,当考虑实现这些模型时,\local模型的一个循环至少需要$O(Δ)$时间单位,而BEEP模型的一个循环需要$O(\logΔ)$时间单位,这是一种改进,减少了大多数设置中$\log(1/ε)$因子的损失。
英文摘要:
We adapt a recent algorithm by Ghaffari [SODA'16] for computing a Maximal Independent Set in the LOCAL model, so that it works in the significantly weaker BEEP model. For networks with maximum degree $Δ$, our algorithm terminates locally within time $O((\log Δ+ \log (1/ε)) \cdot \log(1/ε))$, with probability at least $1 - ε$. The key idea of the modification is to replace explicit messages about transmission probabilities with estimates based on the number of received messages. After the successful introduction (and implicit use) of local analysis, e.g., by Barenboim et al. [JACM'16], Chung et al. [PODC'14], Ghaffari [SODA'16], and Halldorsson et al. [PODC'15], we study this concept in the BEEP model for the first time. By doing so, we improve over local bounds that are implicitly derived from previous work (that uses traditional global analysis) on computing a Maximal Independent Set in the \beep model for a large range of values of the parameter $Δ$. At the same time, we show that our algorithm in the \beep model only needs to pay a $\log(1/ε)$ factor in the runtime compared to the best known MIS algorithm in the much more powerful \local model. We demonstrate that this overhead is negligible, as communication via beeps can be implemented using significantly less resources than communication in the LOCAL model. In particular, when looking at implementing these models, one round of the \local model needs at least $O(Δ)$ time units, while one round in the BEEP model needs $O(\logΔ)$ time units, an improvement that diminishes the loss of a $\log(1/ε)$ factor in most settings.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。