蜂鸣和睡眠:信息和能源效率集封面
Beep-And-Sleep: Message and Energy Efficient Set Cover
摘要:
我们观察到的集合覆盖问题的消息高效的分布式算法。给定$n$元素的基集$U$和$U$的$m$子集,我们的目标是找到包含所有元素的这些子集的最小数量。在这个问题的默认分布式设置中,每个集合与它所包含的每个元素都有一个双向通信链接。我们的第一个结果是一个$\tilde{O}(\log^2(Δ))$ -时间和$O(\sqrt{Δ)}(n+m))$ -消息算法,在$KT_0$模型中具有期望的逼近比$O(\log(Δ))$。值$Δ$表示每个子集的最大基数。我们的算法是\emph{almost}最佳的时间和消息的复杂性。此外,我们在Beeping模型中提出了集合覆盖算法,该算法仅依赖于载波侦听,并且可以以运行时间换取近似比,类似于Kuhn和Wattenhofer的著名算法[PODC '03]。
英文摘要:
We observe message-efficient distributed algorithms for the Set Cover problem. Given a ground set $U$ of $n$ elements and $m$ subsets of $U$, we aim to find the minimal number of these subsets that contain all elements. In the default distributed setup of this problem, each set has a bidirected communication link with each element it contains. Our first result is a $\tilde{O}(\log^2(Δ))$-time and $O(\sqrt{Δ)}(n+m))$-message algorithm with expected approximation ration of $O(\log(Δ))$ in the $KT_0$ model. The value $Δ$ denotes the maximal cardinality of each subset. Our algorithm is \emph{almost} optimal with regard to time and message complexity. Further, we present Set Cover algorithm in the Beeping model that only relies on carrier-sensing and can trade runtime for approximation ratio similar to the celebrated algorithm by Kuhn and Wattenhofer [PODC '03].
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。