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

一种新的稀疏网络Push-Relabel算法

A New Push-Relabel Algorithm for Sparse Networks

Rahul Mehta

摘要:

本文对具有$n$顶点和$m$弧的流网络上的最大流问题提出了一种新的推-重标号算法。我们的算法在稀疏网络上计算$O(mn)$时间的最大流,其中$m = O(n)$。据我们所知,这是用于$m = O(n)$边缘情况的第一个$O(mn)$时间推送重新标记算法;以前,已知推送重新标记实现可以在$m = Ω(n^{1+ε})$(King,et.例如,SODA '92)。这也与Orlin(STOC `13)最近提出的基于流分解的算法相匹配,该算法在稀疏网络上以$O(mn)$时间找到最大流。我们的主要结果是通过减少在所有缩放阶段向$O(mn)$的非饱和推送的数量来改进Excess-Scaling算法(Ahuja & Orlin,1989)。这是通过将Ahuja和Orlin的算法与Orlin的紧凑流网络相结合来实现的。本文的一个贡献是证明了紧凑网络技术可以扩展到推重新标记算法族。我们还提供了证据,这种方法可能是一个很有前途的途径对所有边缘密度的$O(mn)$时间算法。

英文摘要:

In this paper, we present a new push-relabel algorithm for the maximum flow problem on flow networks with $n$ vertices and $m$ arcs. Our algorithm computes a maximum flow in $O(mn)$ time on sparse networks where $m = O(n)$. To our knowledge, this is the first $O(mn)$ time push-relabel algorithm for the $m = O(n)$ edge case; previously, it was known that push-relabel implementations could find a max-flow in $O(mn)$ time when $m = Ω(n^{1+ε})$ (King, et. al., SODA `92). This also matches a recent flow decomposition-based algorithm due to Orlin (STOC `13), which finds a max-flow in $O(mn)$ time on sparse networks. Our main result is improving on the Excess-Scaling algorithm (Ahuja & Orlin, 1989) by reducing the number of nonsaturating pushes to $O(mn)$ across all scaling phases. This is reached by combining Ahuja and Orlin's algorithm with Orlin's compact flow networks. A contribution of this paper is demonstrating that the compact networks technique can be extended to the push-relabel family of algorithms. We also provide evidence that this approach could be a promising avenue towards an $O(mn)$-time algorithm for all edge densities.

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

↑