Improved bounds for the max-flow min-multicut ratio for planar and Kr, r-free graphs
Open Access
- 20 August 1993
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 47 (2) , 77-80
- https://doi.org/10.1016/0020-0190(93)90228-2
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Approximation through multicommodity flowPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- 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
- Multi-Commodity Network FlowsOperations Research, 1963