arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1610.01753cs.DMcs.DS
收藏

协作树探索的一般下界

A general lower bound for collaborative tree exploration

Yann Disser, Frank Mousset, Andreas Noever, Nemanja Škorić, Angelika Steger

摘要:

我们认为协同图形探索与一组$k$代理。所有代理都从一个初始未知图的公共顶点开始,并且需要集体访问所有其他顶点。我们假设代理是确定性的,顶点是可区分的,移动是同时进行的,我们允许代理全球通信。对于这种设置,我们给出了第一个非平凡的下界,弥合小($k \leq \sqrt n$)和大($k \geq n$)团队的代理之间的差距。值得注意的是,我们的边界与这两个领域的现有结果紧密相连。首先,我们显着扩展了$Ω(\log k / \log\log k)$的下限Dynia等。的竞争比的合作树探索策略的范围$k \leq n \log^c n$的任何$c \in \mathbb{N}$。第二,我们提供了一个严格的下限的代理商的数量需要任何竞争性的探索算法。特别是,我们表明,任何与$k = Dn^{1+o(1)}$代理的协作树探索算法具有$ω(1)$的竞争比,而Dereniowski等人。给出了一个算法与$k = Dn^{1+\varepsilon}$代理和竞争比$O(1)$,对于任何$\varepsilon > 0$和$D$表示的直径的图。最后,我们表明,对于任何探索算法使用$k = n$代理,存在树的任意大的高度$D$,需要$Ω(D^2)$轮,我们提供了一个简单的算法,匹配此绑定的所有树。

英文摘要:

We consider collaborative graph exploration with a set of $k$ agents. All agents start at a common vertex of an initially unknown graph and need to collectively visit all other vertices. We assume agents are deterministic, vertices are distinguishable, moves are simultaneous, and we allow agents to communicate globally. For this setting, we give the first non-trivial lower bounds that bridge the gap between small ($k \leq \sqrt n$) and large ($k \geq n$) teams of agents. Remarkably, our bounds tightly connect to existing results in both domains. First, we significantly extend a lower bound of $Ω(\log k / \log\log k)$ by Dynia et al. on the competitive ratio of a collaborative tree exploration strategy to the range $k \leq n \log^c n$ for any $c \in \mathbb{N}$. Second, we provide a tight lower bound on the number of agents needed for any competitive exploration algorithm. In particular, we show that any collaborative tree exploration algorithm with $k = Dn^{1+o(1)}$ agents has a competitive ratio of $ω(1)$, while Dereniowski et al. gave an algorithm with $k = Dn^{1+\varepsilon}$ agents and competitive ratio $O(1)$, for any $\varepsilon > 0$ and with $D$ denoting the diameter of the graph. Lastly, we show that, for any exploration algorithm using $k = n$ agents, there exist trees of arbitrarily large height $D$ that require $Ω(D^2)$ rounds, and we provide a simple algorithm that matches this bound for all trees.

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

↑