Approximating the minimum k-way cut in a graph via minimum 3-way cuts

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

Volumn 1741, Issue , 1999, Pages 373-382

  Zhao, Liang ^a   Nagamochi, Hiroshi ^a   Ibaraki, Toshihide ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

K-WAY CUTS; PERFORMANCE RATIO; RUNNING TIME; WEIGHTED UNDIRECTED GRAPH;

APPROXIMATION ALGORITHMS;

EID: 84949424651     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46632-0_38     Document Type: Conference Paper

References (12)

1. E. Dalhaus, D. S. Johnson, C. H. Papadimitriou, P. Seymour and M. Yannakakis, The complexity of the multiway cuts, extended abstract 1983. The complexity of the multiterminal cuts, SIAM J. Comput. Vol. 23, No. 4, 1994, 864-894.
2. O. Goldschmidt and D. S. Hochbaum, Polynomial algorithm for the k-cut problem, In Proc. 29th IEEE FOCS, 1988, 444-451.
3. A. V. Goldberg and R. E. Tarjan, A new approach to the maximum flow problem, J. of ACM, Vol. 35, No. 4, 1988, 921-940.
4. S. Kapoor, On minimum 3-cuts and approximating k-cuts using cut trees, Lecture Notes in Comput. Sci., 1084, Springer-Verlag, Integer programming and combinatorial optimization, 1996, 132-146.
5. D. R. Karger and C. Stein, A new approach to the minimum cut problems, J.of ACM, Vol. 43, No. 4, 1996, 601-640.
6. Y. Kamidoi, S. Wakabayasi and N. Yoshida, A new approach to the minimum k-way partition problem for weighted graphs, Technical Report of IEICE. COMP97-25, 1997, 25-32.
7. C. H. Lee, M. Kim and C. I. Park, An efficient k-way graph partitioning algorithm for task allocation in parallel computing systems, In Proc. IEEE Int. Conf. on Computer-Aided Design, 1990, 748-751.
8. T. Lengaur, Combinatorial Algorithms for Integrated Circuit Layout, Wiley 1990.
9. H. Nagamochi and T. Ibaraki, A fast algorithm for computing minimum 3-way and 4-way cuts, Lecture Notes in Comput. Sci., 1610, Springer-Verlag, 7th Conf. on Integer Programming and Combinatorial Optimization, 1999, 377-390.
10. H. Nagamochi, S. Katayama and T. Ibaraki, A faster algorithm for computing minimum 5-way and 6-way cuts in graphs, Lecture Notes in Computer Science 1627, Springer-Verlag, 5th Annual Int. Computing and Combinatorics Conf., 1999, 164-173.
11. H. S. Stone, Multiprocessor scheduling with the aid of network flow algorithms, IEEE Trans. on Software Engg., SE-3, 1977, 85-93.
12. H. Saran and V. V. Vazirani, Finding k-cuts within twice the optimal, In Proc. 32nd IEEE FOCS, 1991, 743-751.