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

几乎紧分布最小割算法

Almost-Tight Distributed Minimum Cut Algorithms

Danupon Nanongkai, Hsin-Hao Su

摘要:

研究了加权分布式消息传递网络(CONGEST模型)中最小割的计算问题。令$λ$为最小割,$n$为网络中的节点数,$D$为网络直径。我们的算法可以在$O((\sqrt{n} \log^{*} n+D)λ^4 \log^2 n)$时间内精确计算$λ$。据我们所知,这是第一篇论文,明确研究计算精确的最小切割的分布式设置。以前,这个问题的非平凡次线性时间算法是已知的,只有当$λ\leq 3$由于Pritchard和Thurimella的$O(D)$ -时间和$O(D+n^{1/2}\log^* n)$ -时间算法计算$2$ -边连接和$3$ -边连接组件的未加权图。利用Karger的边缘采样技术,我们可以将该算法转化为对任何$ε>0$的$(1+ε)$ -近似$O((\sqrt{n}\log^{*} n+D)ε^{-5}\log^3 n)$ -时间算法.这改进了Ghaffari和Kuhn先前的$(2+ε)$ -近似$O((\sqrt{n}\log^{*} n+D)ε^{-5}\log^2 n\log\log n)$ -时间算法和$O(ε^{-1})$ -近似$O(D+n^{\frac{1}{2}+ε} \mathrm{poly}\log n)$ -时间算法。由于Das Sarma等人给出的$Ω(D+n^{1/2}/\log n)$的下限适用于任何近似算法,因此该运行时间紧到$ \mathrm{poly}\log n$因子。为了得到规定的运行时间,我们开发了一个近似算法,它结合了Thorup的算法和Matula的收缩算法的思想。与直接应用Thorup的树填充定理相比,它节省了一个$ε^{-9}\log^{7} n$因子。然后,我们结合Kutten和Peleg的树划分算法和Karger的动态规划,以实现一个有效的分布式算法,找到最小切割时,我们给出了一个生成树,交叉的最小切割正好一次。

英文摘要:

We study the problem of computing the minimum cut in a weighted distributed message-passing networks (the CONGEST model). Let $λ$ be the minimum cut, $n$ be the number of nodes in the network, and $D$ be the network diameter. Our algorithm can compute $λ$ exactly in $O((\sqrt{n} \log^{*} n+D)λ^4 \log^2 n)$ time. To the best of our knowledge, this is the first paper that explicitly studies computing the exact minimum cut in the distributed setting. Previously, non-trivial sublinear time algorithms for this problem are known only for unweighted graphs when $λ\leq 3$ due to Pritchard and Thurimella's $O(D)$-time and $O(D+n^{1/2}\log^* n)$-time algorithms for computing $2$-edge-connected and $3$-edge-connected components. By using the edge sampling technique of Karger's, we can convert this algorithm into a $(1+ε)$-approximation $O((\sqrt{n}\log^{*} n+D)ε^{-5}\log^3 n)$-time algorithm for any $ε>0$. This improves over the previous $(2+ε)$-approximation $O((\sqrt{n}\log^{*} n+D)ε^{-5}\log^2 n\log\log n)$-time algorithm and $O(ε^{-1})$-approximation $O(D+n^{\frac{1}{2}+ε} \mathrm{poly}\log n)$-time algorithm of Ghaffari and Kuhn. Due to the lower bound of $Ω(D+n^{1/2}/\log n)$ by Das Sarma et al. which holds for any approximation algorithm, this running time is tight up to a $ \mathrm{poly}\log n$ factor. To get the stated running time, we developed an approximation algorithm which combines the ideas of Thorup's algorithm and Matula's contraction algorithm. It saves an $ε^{-9}\log^{7} n$ factor as compared to applying Thorup's tree packing theorem directly. Then, we combine Kutten and Peleg's tree partitioning algorithm and Karger's dynamic programming to achieve an efficient distributed algorithm that finds the minimum cut when we are given a spanning tree that crosses the minimum cut exactly once.

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

↑