Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- 1 April 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 25 (2), 235-251
- https://doi.org/10.1137/s0097539793243016
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Approximation through multicommodity flowPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Improved Approximations for the Minimum-Cut Ratio and the FluxTheory of Computing Systems, 1996
- Improved bounds for the max-flow min-multicut ratio for planar and Kr, r-free graphsInformation Processing Letters, 1993
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- The optimal multiterminal cut problemPublished by American Mathematical Society (AMS) ,1991
- Complexity of network synchronizationJournal of the ACM, 1985
- Edge-Deletion ProblemsSIAM Journal on Computing, 1981
- Multi-Commodity Network FlowsOperations Research, 1963
- A note on the maximum flow through a networkIEEE Transactions on Information Theory, 1956
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956