Affiliation:
1. NEC Research Institute, Princeton, NJ
Abstract
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our approach leads to an
O
(min(
n
2/3
,
m
1/2
)
m
log(
n
2
/
m
) log
U
) time bound for a network with
n
vertices,
m
arcs, and integral arc capacities in the range [1, …,
U
]. This is a fundamental improvement over the previous time bounds. We also improve bounds for the Gomory-Hu tree problem, the parametric flow problem, and the approximate
s-t
cut problem.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference42 articles.
1. ADEL'SON-VEL'SKI G. M. DINIC E. A. AND KARZANOV A. V. 1975. Flow Algorithms. Nauka Moscow CIS (in Russian). ADEL'SON-VEL'SKI G. M. DINIC E. A. AND KARZANOV A. V. 1975. Flow Algorithms. Nauka Moscow CIS (in Russian).
2. A fast and simple algorithm for the maximum flow problem;AHUJA R. K.;Oper. Res.,1989
3. Improved Time Bounds for the Maximum Flow Problem
4. Generating pseudo-random permutations and maximum flow algorithms
Cited by
310 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献