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

图和超图中最大匹配的分布式局部近似算法

Distributed local approximation algorithms for maximum matching in graphs and hypergraphs

David G. Harris

AI总结:

本文提出分布式局部模型下超图最大权重匹配的$O(r)$近似确定性算法,并应用于图匹配、超图最大匹配、边列表着色和边定向,获得近乎最优或更快的轮复杂度。

摘要:

我们描述了Linial经典LOCAL分布式计算模型中的近似算法,用于在秩为$r$的超图中寻找最大权重匹配。我们的主要结果是一个确定性算法,生成一个$O(r)$-近似于最大权重匹配的匹配,运行时间为$\tilde O(r \log \Delta+ \log^2 \Delta+ \log^* n)$轮。(这里,$\tilde O()$记号隐藏了$\text{polyloglog } \Delta$和$\text{polylog } r$因子)。这基于许多新的去随机化技术,扩展了Ghaffari、Harris和Kuhn(2017)的方法。\n作为主要应用,我们为长期研究的最大权重图匹配问题获得了近乎最优的算法。具体来说,我们得到一个$(1+\epsilon)$近似算法,使用$\tilde O(\log \Delta/ \epsilon^3 + \text{polylog}(1/\epsilon, \log \log n))$随机时间和$\tilde O(\log^2 \Delta/ \epsilon^4 + \log^*n / \epsilon)$确定性时间。\n第二个应用是超图最大匹配的更快算法,这是Ghaffari等人(2017)为各种局部图算法引入的多功能子程序。这给出了一个$(2 \Delta- 1)$-边列表着色算法,确定性运行时间为$\tilde O(\log^2 \Delta\log n)$轮,或随机运行时间为$\tilde O( (\log \log n)^3 )$轮。另一个结果(通过额外优化)是一个算法,为树状度$\lambda$的图生成出度至多$\lceil (1+\epsilon) \lambda\rceil$的边定向;对于固定的$\epsilon$,该算法确定性运行时间为$\tilde O(\log^6 n)$轮,或随机运行时间为$\tilde O(\log^3 n )$轮。

英文摘要:

We describe approximation algorithms in Linial's classic LOCAL model of distributed computing to find maximum-weight matchings in a hypergraph of rank $r$. Our main result is a deterministic algorithm to generate a matching which is an $O(r)$-approximation to the maximum weight matching, running in $\tilde O(r \log Δ+ \log^2 Δ+ \log^* n)$ rounds. (Here, the $\tilde O()$ notations hides $\text{polyloglog } Δ$ and $\text{polylog } r$ factors). This is based on a number of new derandomization techniques extending methods of Ghaffari, Harris & Kuhn (2017). As a main application, we obtain nearly-optimal algorithms for the long-studied problem of maximum-weight graph matching. Specifically, we get a $(1+ε)$ approximation algorithm using $\tilde O(\log Δ/ ε^3 + \text{polylog}(1/ε, \log \log n))$ randomized time and $\tilde O(\log^2 Δ/ ε^4 + \log^*n / ε)$ deterministic time. The second application is a faster algorithm for hypergraph maximal matching, a versatile subroutine introduced in Ghaffari et al. (2017) for a variety of local graph algorithms. This gives an algorithm for $(2 Δ- 1)$-edge-list coloring in $\tilde O(\log^2 Δ\log n)$ rounds deterministically or $\tilde O( (\log \log n)^3 )$ rounds randomly. Another consequence (with additional optimizations) is an algorithm which generates an edge-orientation with out-degree at most $\lceil (1+ε) λ\rceil$ for a graph of arboricity $λ$; for fixed $ε$ this runs in $\tilde O(\log^6 n)$ rounds deterministically or $\tilde O(\log^3 n )$ rounds randomly.

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

↑