Finding maximum flows in undirected graphs seems easier than bipartite matching
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Better random sampling algorithms for flows in undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Minimizing weighted completion time on a single machine
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Random sampling in residual graphs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient agent-based simulation framework for multi-node supercomputers
Proceedings of the 38th conference on Winter simulation
A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Advanced combinatorial algorithms
Algorithms and theory of computation handbook
Approximation scheme for lowest outdegree orientation and graph density measures
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.00 |
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 are capacities. Our approach leads to an O(min(n/sup 2/3/, m/sup 1/2/)m log(n/sup 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 problems.