Fast algorithms for even/odd minimum cuts and generalizations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1879, Issue , 2000, Pages 88-99

  Benczúr, András A ^a   Fiilõp, Ottilia ^b  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^b BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; DIRECTED GRAPHS;

FAST ALGORITHMS; MINIMUM CUT; SET SYSTEM; STEINER; SUBMODULAR FUNCTIONS; VERTEX SET;

DIRECTED GRAPHS; ALGORITHMS;

EID: 84877859452     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45253-2_9     Document Type: Article

References (16)

1. Ahuja, R.K., T.L. Magnanti and J.B. Orlin, Network flows: Theory, Algorithms and Applications. Prentice Hall (1993).
2. Barahona, F. and M. Conforti, A construction for binary matroids. Discr. Math. 66:213-218 (1987)
3. Benczur, A. A., Counterexamples for directed and node capacitated cut-trees. Siam J. Comp. 24(3):505-510 (1995)
4. Cheng, C. K. and T. C. Hu, Ancestor trees for arbitrary multi-terminal cut functions. Ann. Op. Res. 33:199-213 (1991)
5. Gabow, H. N., M. X. Goemans and D. P. Williamson, An efficient approximation algorithm for the survivable network design problem. Proc.3rd IPCO, pp. 57-74 (1993)
6. Goemans, M. X. and V. S. Ramakrishnan, Minimizing submodular functions over families of sets. Combinatorica 15(4):499-513 (1995)
7. Goemans, M. X. and D. P. Williamson, The Primal-Dual Method for Approximation Algorithms and its Application to Network Design Problems, Chapter 4 in Approximation Algorithms, D. Hochbaum, Ed. (1997)
8. Gomory, R. E. and T. C. Hu, Multi-terminal network flows, J. SIAAM 9:551-570 (1961)
9. Grotschel, M., L. Lovasz and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1:169-197 (1981)
10. Grotschel, M., L. Lovasz and A. Schrijver, Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 4:291-295 (1984)
11. Grotschel, M., L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin, 1988.
12. Hao, J. and J. B. Orlin, A faster algorithm for finding the minimum cut in a graph, Proc. of 3rd SODA, pp. 165-174 (1992)
13. Lovasz, L., Submodular functions and convexity, in: A. Bachem, M. Grotschel and B. Korte (eds.), Mathematical Programming: The State ofthe Art, Bonn, 1982. Springer, Berlin, pp. 235-257 (1983)
14. Padberg, M. W. and M. R. Rao, Odd minimum cut-sets and 6-matchings. Math. Op. Res. 7:67-80 (1982)
15. Picard, J. C. and M. Queyranne. Selected applications of minimum cuts in networks, I.N.F.O.R: Canadian Journal of Operations Research and Information Processing 20:394-422 (1982)
16. 16 Rizzi, R, Excluding a simple good pair approach to directed cuts Graphs and Combinatorics, to appear