Crossing properties of multiterminal cuts

Networks

Volumn 34, Issue 3, 1999, Pages 215-220

  Easley, Robert F ^a   Hartvigsen, David ^a  

^a UNIVERSITY OF NOTRE DAME   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033211642     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199910)34:3<215::AID-NET6>3.0.CO;2-E     Document Type: Article

References (18)

1. [1] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. [2] C.K. Cheng and T.C. Hu, Ancestor tree for arbitrary multiterminal cut functions, Ann Oper Res 33 (1991), 199-213.
3. [3] S. Chopra and M.R. Rao, On the multiway cut polyhedra, Networks 21 (1991), 51-89.
4. [4] W.H. Cunningham, The optimal multiterminal cut problem, DIMACS Ser Discr Math Theor Comput Sci 5 (1991), 105-120.
5. [5] E. Dahlnaus, D.S. Johnson, C.H. Papadimitriou, P. Seymour, and M. Yannakakis, The complexity of multiway cuts, SIAM J Comput 23 (1994), 864-894.
6. [6] M. Fiala, The minimum 3-cut problem: An application of polyhedral combinatorics, Honors project, Carleton University, 1986.
7. [7] S. Fujishige, Submodular functions and optimization, North-Holland, Amsterdam, 1991.
8. [8] O. Goldschmidt and D.S. Hochbaum, A polynomial algorithm for the k-cut problem for fixed k, Math of OR (1994), 24-37.
9. [9] R.E. Gomory and T.C. Hu, Multi-terminal network flows, J SIAM 9 (1961), 551-570.
10. [10] D. Hartvigsen, The planar multiterminal cut problem, Discr Appl Math 85 (1998), 203-222.
11. [11] D. Hartvigsen, Compact representations of cuts, Working paper, 1998.
12. [12] R. Hassin, An algorithm for computing maximum solution bases, Oper Res Lett 9 (1990), 315-318.
13. [13] R. Hassin, Solution bases of multiterminal cut problems, Math Oper Res 13 4 (1988), 535-542.
14. [14] T.C. Hu, Combinatorial algorithms, Addison-Wesley, Reading, MA, 1982.
15. [15] S. Kapoor, On minimum 3-cuts and approximating k-cuts using cut trees, Proc 5th International IPCO Conf, 1996, pp. 132-146.
16. [16] D.R. Karger and C. Stein, A new approach to the minimum cut problem, J ACM 43 (1996), 601-640.
17. [17] J.C. Picard and M. Queyranne, Selected applications of minimum cuts in networks, INFOR 20 (1982), 394-422.
18. [18] Waterloo Maple Software, 160 Columbia Street West, Waterloo, Ontario, Canada, N2L 3G1.