arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1802.03160cs.DScs.DC
收藏

分布式扳手近似

Distributed Spanner Approximation

Keren Censor-Hillel, Michal Dory

摘要:

我们解决的基本网络设计问题,构建近似最小空间。我们的贡献是分布式设置,提供算法和硬度的结果。我们的主要硬度结果表明,$α$ -近似的最小有向$k$-问题$k \geq 5$需要$Ω(n /\sqrtα\log{n})$轮使用确定性算法或$Ω(\sqrt{n }/\sqrtα\log{n})$轮使用随机的,在分布式计算的CONGEST模型。结合[Barenboim,Elkin and Gavoille,2016]中的CONGEST模型中的常数轮$O(n^ε)$ -近似算法,以及我们在这里展示的CONGEST模型中的多对数轮$(1+ε)$ -近似算法,我们对CONGEST模型的下界意味着CONGEST和CONGEST模型之间的严格分离。值得注意的是,据我们所知,这是这些模型之间的局部近似问题的第一次分离。类似地,有向和无向情况之间的分离是隐含的。我们还证明了一个近似线性下界的最小加权$k$-问题的$k \geq 4$,我们显示的加权2-问题的下界。在算法方面,除了上述的$(1+ε)$ -近似算法的最小$k$ -空间,我们的主要贡献是一个新的分布式结构的最小2-空间,只使用多项式的本地计算。我们的算法有一个保证的近似比为$O(\log(m/n))$的图与$n$顶点和$m$边,它匹配的多项式时间序列算法[Kortsarz和Peleg,1994]的最佳已知的比率,如果我们限制自己的多项式本地计算是紧的。我们的方法使我们能够扩展我们的算法,也为定向,加权和客户端-服务器的问题的变种。

英文摘要:

We address the fundamental network design problem of constructing approximate minimum spanners. Our contributions are for the distributed setting, providing both algorithmic and hardness results. Our main hardness result shows that an $α$-approximation for the minimum directed $k$-spanner problem for $k \geq 5$ requires $Ω(n /\sqrtα\log{n})$ rounds using deterministic algorithms or $Ω(\sqrt{n }/\sqrtα\log{n})$ rounds using randomized ones, in the CONGEST model of distributed computing. Combined with the constant-round $O(n^ε)$-approximation algorithm in the LOCAL model of [Barenboim, Elkin and Gavoille, 2016], as well as a polylog-round $(1+ε)$-approximation algorithm in the LOCAL model that we show here, our lower bounds for the CONGEST model imply a strict separation between the LOCAL and CONGEST models. Notably, to the best of our knowledge, this is the first separation between these models for a local approximation problem. Similarly, a separation between the directed and undirected cases is implied. We also prove a nearly-linear lower bound for the minimum weighted $k$-spanner problem for $k \geq 4$, and we show lower bounds for the weighted 2-spanner problem. On the algorithmic side, apart from the aforementioned $(1+ε)$-approximation algorithm for minimum $k$-spanners, our main contribution is a new distributed construction of minimum 2-spanners that uses only polynomial local computations. Our algorithm has a guaranteed approximation ratio of $O(\log(m/n))$ for a graph with $n$ vertices and $m$ edges, which matches the best known ratio for polynomial time sequential algorithms [Kortsarz and Peleg, 1994], and is tight if we restrict ourselves to polynomial local computations. Our approach allows us to extend our algorithm to work also for the directed, weighted, and client-server variants of the problem.

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

↑