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

在 $n^{2+o(1)}$ 时间内通过增广路径求解最大流

Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time

New York University(纽约大学);Rutgers University(罗格斯大学);KTH Royal Institute of Technology(皇家理工学院);Max Planck Institute for Informatics(马克斯·普朗克 informatics 研究所);University of Michigan(密歇根大学);Stanford University(斯坦福大学)

Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu

AI总结:

本文提出基于加权 push-relabel 与有向扩张器层次结构的增广路径最大流算法,在稠密有向图上达到 $n^{2+o(1)}\log U$ 的近最优时间。

摘要:

我们提出了一种组合算法,用于在具有 $n$ 个顶点且边容量来自 $\{1,\dots,U\}$ 的有向图中计算精确最大流,其运行时间为 $n^{2+o(1)}\log U$,在稠密图中近乎最优。该算法是经典增广路径框架的一种新颖实现:我们利用 push-relabel 算法的一个新变体更高效地枚举增广路径,该变体使用额外边权来引导算法,而这些边权通过构造有向扩张器层次结构得到。即使在单位容量图中,当图有 $m=\omega(n^{4/3})$ 条边时,这也打破了 Karzanov(1973)以及 Even 和 Tarjan(1975)以往组合算法长期保持的 $O(m\cdot\min\{\sqrt{m},n^{2/3}\})$ 时间界。值得注意的是,我们的方法既不依赖连续优化,也不依赖重型动态图数据结构;而在促成 Chen 等人(FOCS 2022)近线性时间算法的近期进展中,这两者都至关重要。我们的运行时间也与 Chuzhoy 和 Khanna(STOC 2024)用于计算最大二分匹配的独立组合算法的 $n^{2+o(1)}$ 时间界相匹配,而最大二分匹配是最大流的一个特例。

英文摘要:

We present a combinatorial algorithm for computing exact maximum flows in directed graphs with $n$ vertices and edge capacities from $\{1,\dots,U\}$ in $n^{2+o(1)}\log U$ time, which is almost optimal in dense graphs. Our algorithm is a novel implementation of the classical augmenting-path framework; we list augmenting paths more efficiently using a new variant of the push-relabel algorithm that uses additional edge weights to guide the algorithm, and we derive the edge weights by constructing a directed expander hierarchy. Even in unit-capacity graphs, this breaks the long-standing $O(m\cdot\min\{\sqrt{m},n^{2/3}\})$ time bound of the previous combinatorial algorithms by Karzanov (1973) and Even and Tarjan (1975) when the graph has $m=ω(n^{4/3})$ edges. Notably, our approach does not rely on continuous optimization nor heavy dynamic graph data structures, both of which are crucial in the recent developments that led to the almost-linear time algorithm by Chen et al. (FOCS 2022). Our running time also matches the $n^{2+o(1)}$ time bound of the independent combinatorial algorithm by Chuzhoy and Khanna (STOC 2024) for computing the maximum bipartite matching, a special case of maximum flow.

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

↑