Concurrent flow and concurrent connectivity on graphs
Graph theory with applications to algorithms and computer science
The maximum concurrent flow problem
Journal of the ACM (JACM)
Improved bounds on the max-flow min-cut ratio for multicommodity flows
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximate max-flow min-(multi)cut theorems and their applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Randomized algorithms
Computational experience with a difficult mixed-integer multicommodity flow problem
Mathematical Programming: Series A and B
Bipartite dimensions and bipartite degrees of graphs
Discrete Mathematics
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
SIAM Journal on Computing
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Approximate max-integral-flow/min-multicut theorems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Polynomiality of sparsest cuts with fixed number of sources
Operations Research Letters
Metric inequalities and the Network Loading Problem
Discrete Optimization
| Hi-index | 0.00 |
We present an improved bound on the min-cut max-flow ratio for multicommodity flow problems with specified demands. To obtain the numerator of this ratio, capacity of a cut is scaled by the demand that has to cross the cut. In the denominator, the maximum concurrent flow value is used. Our new bound is proportional to log(k*) where k* is the cardinality of the minimal vertex cover of the demand graph.