A lower bound on the integrality gap for minimum multicut in directed networks

Combinatorica

Volumn 24, Issue 3, 2004, Pages 525-530

  Saks, Michael ^a   Samorodnitsky, Alex ^c   Zosin, Leonid ^b  

^a RUTGERS UNIVERSITY   (United States)

^b ITG Inc   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 6344244636     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-004-0031-x     Document Type: Article

References (14)

1. R. K. AHUJA, T. L. MAGNANTI and J. ORLIN: Network Flows, Prentice Hall, Englewood Cliffs, NJ, 1993.
2. G. M. ADELSON-WELSKY, E. A. DINITS and A. V. KARZANOV: Flow Algorithms (in Russian), Nauka, Moscow, 1975.
3. L. R. FORD and D. J. FULKERSON: Maximal Flow through a network, Canadian J. of Math 8 399-404.
4. A. FRANK: Connectivity and Network Flows, in Handbook of Combinatorics, Volume I, R. L. Graham, M. Grötschel, L. Lovász, eds., Elsevier Science B. V., Amsterdam, pp. 111-178, 1995.
5. N. GARG, V. V. VAZIRANI and M. YANNAKAKIS: Approximate max-flow min-(multi) cut theorems and their applications, 25th STOC, pp. 698-707, 1993. To appear in SIAM Journal on Computing.
6. N. GARG, V. V. VAZIRANI and M. YANNAKAKIS: Approximate max-flow min-(multi) cut theorems and their applications, 25th STOC, pp. 698-707, 1993. To appear in SIAM Journal on Computing.
7. T. C. HU: Multicommodity network flows, Operations Research 11 (1963), 344-360.
8. T. LEIGHTON and S. RAO: An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, 29th FOCS, pp. 422-431, 1988.
9. M. LOMONOSOV: Combinatorial approaches to multiflow problems, Discrete Applied Mathematics 11 (1985), 1-93.
10. H. OKAMURA and P. D. SEYMOUR: Multicommodity flows in planar graphs, Journal of Combinatorial Theory (B) 31 (1989), 75-81.
11. B. ROTHSCHILD and A. WHINSTON: On two-commodity network flows, Operations Research 14 (1966), 377-387.
12. P. D. SEYMOUR: Four terminous flows, Networks 10 (1980), 79-86.
13. P. D. SEYMOUR: Matroids and multicommodity flows, European Journal of Combinatorics 2 (1981), 257-290.
14. r,r-free graphs, Inform. Process. Lett. 47:2 (1993), 77-80.