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

全动态电流:稀疏Maxflow比Goldberg-Rao更快

Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao

Yu Gao, Yang P. Liu, Richard Peng

摘要:

给出了一个计算具有$m$边且容量在$[1, U]$范围内的图在$\widetilde{O}(m^{\frac{3}{2} - \frac{1}{328}} \log U)$时间上的精确最大流的算法。对于具有多项式有界整数容量的稀疏图,这是对[Goldberg-Rao JACM '98]的$\widetilde{O}(m^{1.5} \log U)$时间界的第一次改进。我们的算法围绕着动态地保持在核心的内点法的算法从[Mackdry JACM '16]的扩增电流。这需要设计数据结构,其在有限的设置中返回经历电阻更新的图中具有大电能的边缘。

英文摘要:

We give an algorithm for computing exact maximum flows on graphs with $m$ edges and integer capacities in the range $[1, U]$ in $\widetilde{O}(m^{\frac{3}{2} - \frac{1}{328}} \log U)$ time. For sparse graphs with polynomially bounded integer capacities, this is the first improvement over the $\widetilde{O}(m^{1.5} \log U)$ time bound from [Goldberg-Rao JACM `98]. Our algorithm revolves around dynamically maintaining the augmenting electrical flows at the core of the interior point method based algorithm from [Mądry JACM `16]. This entails designing data structures that, in limited settings, return edges with large electric energy in a graph undergoing resistance updates.

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

↑