Scaling algorithms for network problems
Journal of Computer and System Sciences
A new approach to the maximum flow problem
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A data structure for dynamic trees
Journal of Computer and System Sciences
Improved time bounds for the maximum flow problem
SIAM Journal on Computing
Analysis of preflow push algorithms for maximum network flow
SIAM Journal on Computing
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A faster deterministic maximum flow algorithm
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
An o(n^3)-Time Algorithm Maximun-Flow Algorithm
SIAM Journal on Computing
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
A computational study of the capacity scaling algorithm for the maximum flow problem
Computers and Operations Research
Hi-index | 0.01 |
In this paper, we generalize the capacity-scaling techniques in the design of algorithms for the maximum flow problem. Since all previous scaling max-flow algorithms use only one scale factor of value 2, we propose introducing a double capacity-scaling to improve and generalize them. The first capacity scaling has a variable scale factor β and the second uses the value 2. We show that, for different values of the scale factor β, both the classical scaling algorithm (with β = U) and the two-phase double scaling-capacity max-flow algorithm (with β= 2) can be obtained. Moreover, theoretical complexities based on the worst-case analysis can be built depending on the values of β. In addition, a unique and simple implementation of the generalized method is possible and several strategies to improve its practical behavior can be incorporated. The paper finishes with a computational experiment that shows that the running time of capacity-scaling algorithms decreases as β increases.