Improved bounds on the max-flow min-cut ratio for multicommodity flows
- 1 September 1995
- journal article
- research article
- Published by Springer Nature in Combinatorica
- Vol. 15 (3) , 425-434
- https://doi.org/10.1007/bf01299746
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Packing directed circuits fractionallyCombinatorica, 1995
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applicationsCombinatorica, 1995
- Approximating minimum feedback sets and multi-cuts in directed graphsPublished by Springer Nature ,1995
- Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networksPublished by Association for Computing Machinery (ACM) ,1994
- Approximate max-flow min-(multi)cut theorems and their applicationsPublished by Association for Computing Machinery (ACM) ,1993
- Improved bounds on the max-flow min-cut ratio for multicommodity flowsPublished by Association for Computing Machinery (ACM) ,1993
- Fast approximation algorithms for multicommodity flow problemsPublished by Association for Computing Machinery (ACM) ,1991
- An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Matroids and Multicommodity FlowsEuropean Journal of Combinatorics, 1981
- Multicommodity flows in planar graphsJournal of Combinatorial Theory, Series B, 1981