On minimum 3-cuts and approximating k-cuts using cut trees

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

Volumn 1084, Issue , 1996, Pages 132-146

  Kapoor, Sanjiv ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; FORESTRY; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION;

APPROXIMATION FACTOR; BOUNDING TECHNIQUES; CUT-TREE; FLOW COMPUTATION; GRAPH PARTITIONING; MIN-CUT; PARTITIONING PROBLEM; UNDIRECTED GRAPH;

TREES (MATHEMATICS);

EID: 84947924962     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61310-2_11     Document Type: Conference Paper

References (11)

1. [Ch] V. Chvátal, "Tough graphs and Hamiltonian circuits," Discrete Mathematics, Vol. 5, 1973, pp. 215-228.
2. [Cu] W. H. Cunningham, "Optimal attack and reinforcement of a network," JÅ CM, Vol. 32, No. 3, 1985, pp. 549-561.
3. [CE] S. Chopra and M.R. Rao,"On the Multi-way cut Polyhedron," NETWORKS), 1991, 51-89.
4. [DJPSY] E. Dalhaus, D. S. Johnson, C. H. Papadimitriou, P. Seymour and M. Yan-Nalcalde, "The complexity of the multiway cuts," Proc. 24th Annual ACM Symposium on the Theory of Computing, 1992, pp. 241-251.
5. [GoHu] R. Gomory and T. C. Hu, "Multi-terminal network flows," J. SIAM, Vol. 9, 1961, pp. 551-570.
6. [GH] O. Goldschmidt and D. S. Hochbaum, "Polynomial algorithm for the k-cut problem," Proc. 29th Annual Symp. on the Foundations of Computer Science, 1988, pp. 444-451.
7. [He] Xin He, "On the planar 3-cut problem," J. Algorithms, 12, 1991, pp. 23-37.
8. S) algorithm for the planar 3-cut problem," SIAM J. on Alg. and Discrete Methods, 6:4:707-712, 1985.
9. [SV] H. Saran and V. Vasirani, "Finding i-cuts within twice the optimal," Proc. 32nd Annual Symp. on Foundation of Computer Science, 1991, 743-751.
10. [SW] M. Stoer and F. Wagner, "A Simple Min Cut Algorithm," Technical Report, Fachberich Mathematik and Informatik, Freie Universitat, Berlin.
11. [S] H.S. Stone, "Multiprocessor scheduling with the aid of Network flow algorithms," IEEE Trans.on Software Engg., SE-3, 1977, 85-93.