A new approach to the maximum-flow problem
Journal of the ACM (JACM)
A data structure for dynamic trees
Journal of Computer and System Sciences
A fast parametric maximum flow algorithm and applications
SIAM Journal on Computing
Improved time bounds for the maximum flow problem
SIAM Journal on Computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
Journal of the ACM (JACM)
Critical Load Factors in Two-Processor Distributed Systems
IEEE Transactions on Software Engineering
A simple local-control approximation algorithm for multicommodity flow
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Journal of Computer and System Sciences
A maximum flow algorithm using MA ordering
Operations Research Letters
Experimental evaluation of parametric max-flow algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Balancing algorithm for the minimum flow problem in parametric bipartite networks
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
Hi-index | 0.00 |
We explore balancing as a definitional and algorithmic tool for finding minimum cuts and maximum flows in ordinary and parametric networks. We show that a standard monotonic parametric maximum flow problem can be formulated as a problem of computing a particular maximum flow that is balanced in an appropriate sense. We present a divide-and-conquer algorithm to compute such a balanced flow in a logarithmic number of ordinary maximum-flow computations. For the special case of a bipartite network, we present two simple, local algorithms for computing a balanced flow. The local balancing idea becomes even simpler when applied to the ordinary maximum flow problem. For this problem, we present a round-robin arc-balancing algorithm that computes a maximum flow on an n- vertex, m-arc network with integer arc capacities of at most U in O(n2m log(nU)) time. Although this algorithm is slower by at least a factor of n than other known algorithms, it is extremely simple and well-suited to parallel and distributed implementation.