Optimal 3-Terminal cuts and linear programming

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

Volumn 1610, Issue , 1999, Pages 114-125

  Cunningham, William H ^a   Tang, Lawrence ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; GRAPH THEORY; LINEAR PROGRAMMING;

EDGE WEIGHTS; LINEAR PROGRAMMING RELAXATION; MINIMUM TOTAL WEIGHTS; NON NEGATIVES; PERFORMANCE GUARANTEES; TERMINAL NODES; TWO TERMINALS; UNDIRECTED GRAPH;

INTEGER PROGRAMMING;

EID: 84948964973     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48777-8_9     Document Type: Conference Paper

References (7)

1. G. Călinescu, H. Karloff, and Y. Rabani: An improved approximation algorithm for MULTIWAY CUT Proceedings of Symposium on Theory of Computing, ACM, 1998.
2. Kevin Cheung, private communication, 1999.
3. S. Chopra and M.R. Rao, “On the multiway cut polyhedron”, Networks 21(1991), 51-89.
4. W.H. Cunningham, “The optimal multiterminal cut problem”, in: C. Monma and F. Hwang (eds.), Reliability of Computer and Communications Networks, American Math. Soc., 1991, pp. 105-120.
5. E. Dahlhaus, D. Johnson, C. Papadimitriou, P. Seymour, and M. Yannakakis, “The Complexity of multiway cuts”, extended abstract, 1983.
6. E. Dahlhaus, D. Johnson, C. Papadimitriou, P. Seymour, and M. Yannakakis, “The Complexity of multiterminal cuts”, SIAM J. Computing, 23(1994), 864-894.
7. D. Karger, P. Klein, C. Stein, M. Thorrup, and N. Young, “Rounding algorithms for a geometric embedding of minimum multiway cut,” Proceedings of Symposium on Theory of Computing, ACM, 1999, to appear.