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

图流上两次、三次和几次以上的最大匹配

Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams

Sagar Kale, Sumedh Tirodkar

摘要:

我们考虑Feigenbaum,Kannan,McGregor,Suri和Zhang的半流模型中的最大匹配问题,该模型受到当今巨型图的启发。作为我们的主要结果,我们给出了无三角形图的两遍$(1/2 + 1/16)$ -逼近算法和一般图的两遍$(1/2 + 1/32)$ -逼近算法,这改进了Konrad,Magniez和Mathieu的$1/2 + 1/52$对二分图和$1/2 + 1/140$对一般图的逼近率.在三个阶段中,我们分别得到了$1/2 + 1/10$对无三角形图的逼近比和$1/2 + 1/19.753$对一般图的逼近比。我们还给出了一个多遍算法,其中我们精确地限制了遍数-我们给出了一个$(2/3 -\varepsilon)$近似算法,该算法使用$2/(3\varepsilon)$遍用于无三角形图,使用$4/(3\varepsilon)$遍用于一般图。我们的算法是简单的和组合的,使用$O(n \log n)$空间,并有$O(1)$更新时间每边。对于一般的图,我们的多遍算法在遍数方面改进了最著名的确定性算法:Ahn和Guha给出了使用$O(\log(1/\varepsilon)/\varepsilon^2)$遍的$(2/3 - \varepsilon)$ -近似算法,而我们的$(2/3 - \varepsilon)$ -近似算法使用$4/(3\varepsilon)$遍;他们还给出了使用$O(\log n \cdot \mathrm{poly}(1/\varepsilon))$遍的$(1-\varepsilon)$ -近似算法,其中$n$是输入图的顶点数;虽然我们的算法是$(2/3 - \varepsilon)$ -近似,但是我们的遍数不依赖于$n$。早期的多通道算法要么在大$O$符号中有一个大的常数用于通道数,要么由于涉及的分析而无法确定常数,因此我们的多通道算法应该使用更少的通道来近似比略低于$2/3$。

英文摘要:

We consider the maximum matching problem in the semi-streaming model formalized by Feigenbaum, Kannan, McGregor, Suri, and Zhang that is inspired by giant graphs of today. As our main result, we give a two-pass $(1/2 + 1/16)$-approximation algorithm for triangle-free graphs and a two-pass $(1/2 + 1/32)$-approximation algorithm for general graphs; these improve the approximation ratios of $1/2 + 1/52$ for bipartite graphs and $1/2 + 1/140$ for general graphs by Konrad, Magniez, and Mathieu. In three passes, we achieve approximation ratios of $1/2 + 1/10$ for triangle-free graphs and $1/2 + 1/19.753$ for general graphs. We also give a multi-pass algorithm where we bound the number of passes precisely---we give a $(2/3 -\varepsilon)$-approximation algorithm that uses $2/(3\varepsilon)$ passes for triangle-free graphs and $4/(3\varepsilon)$ passes for general graphs. Our algorithms are simple and combinatorial, use $O(n \log n)$ space, and have $O(1)$ update time per edge. For general graphs, our multi-pass algorithm improves the best known deterministic algorithms in terms of the number of passes: --Ahn and Guha give a $(2/3 - \varepsilon)$-approximation algorithm that uses $O(\log(1/\varepsilon)/\varepsilon^2)$ passes, whereas our $(2/3 - \varepsilon)$-approximation algorithm uses $4/(3\varepsilon)$ passes; --they also give a $(1-\varepsilon)$-approximation algorithm that uses $O(\log n \cdot \mathrm{poly}(1/\varepsilon))$ passes, where $n$ is the number of vertices of the input graph; although our algorithm is $(2/3 - \varepsilon)$-approximation, our number of passes do not depend on $n$. Earlier multi-pass algorithms either have a large constant inside big-$O$ notation for the number of passes or the constant cannot be determined due to the involved analysis, so our multi-pass algorithm should use much fewer passes for approximation ratios bounded slightly below $2/3$.

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

↑