A deterministic algorithm for finding all minimum k-way cuts

SIAM Journal on Computing

Volumn 36, Issue 5, 2006, Pages 1329-1341

  Kamidoit, Yoko ^a   Yoshidat, Noriyoshi ^a   Nagamochi, Hiroshi ^b  

^a HIROSHIMA CITY UNIVERSITY   (Japan)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

Divide and conquer; Minimum cut; Multiway cut

Indexed keywords

ALGORITHMS; GRAPH THEORY; NUMERICAL METHODS; PROBLEM SOLVING;

DETERMINISTIC ALGORITHM; DIVIDE-AND-CONQUER; MINIMUM CUT; MULTIWAY CUT;

COMPUTATION THEORY;

EID: 35448986623     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/050631616     Document Type: Article

References (40)

1. C. J. ALPERT AND A. B. KAHNG, Recent directions in netlist partitioning: A survey, Integration, The VLSI Journal, 19 (1995), pp. 1-81.
2. D. BERTSIMAS, C. P. TEO, AND R. VOHRA, Analysis of LP relaxations for multiway and multicut problems, Networks, 34 (1999), pp. 102-114.
3. C. J. COLBOURN, The Combinatorics of Network Reliability, Oxford University Press, Oxford, UK, 1987.
4. W. H. CUNNINGHAM, Optimal attack and reinforcement of a network, J. ACM, 32 (1985), pp. 549-561.
5. E. DAHLHAUS, D. S. JOHNSON, C. H. P APADIMITRIOU, P. D. SEYMOUR, AND M. YANNAKAKIS, The complexity of multiterminal cuts, SIAM J. Comput., 23 (1994), pp. 864-894.
6. W. E. DONATH, Logic partitioning, in Physical Design Automation of VLSI Systems, B. T. Preas and M. J. Lorenzetti, eds., Benjamin Cummings, Menlo Park, CA, 1988, pp. 65-86.
7. A. V. GOLDBERG AND R. E. TARJAN, A new approach to the maximum-flow problem, J. ACM, 35 (1998), pp. 921-940.
8. O. GOLDSCHMIDT AND D.S. HOCHBAUM, Polynomial algorithm for the k-cut problem for fixed k, Math. Oper. Res., 19 (1994), pp. 24-37.
9. D. GUSFIELD, Connectivity and edge-disjoint spanning trees, Inform. Process. Lett., 16 (1983), pp. 87-89.
10. H. W. HAMACHER, J.-C. PICARD, AND M. QUEYRANNE, Ranking the cuts and cut-sets of a network, in Algebraic and Combinatorial Methods in Operations Research, North-Holland Math. Stud. 95, North-Holland, Amsterdam, 1984, pp. 183-200.
11. H. W. HAMACHER, J.-C. PICARD, AND M. QUEYRANNE, On finding the K best cuts in a network, Oper. Res. Lett., 2 (1984), pp. 303-305.
12. J. HAO AND J. ORLIN, A faster algorithm for finding the minimum cut in a directed graph, J. Algorithms, 17 (1994), pp. 424-446.
13. D. HARTVIGSEN, Minimum path basis, J. Algorithms, 15 (1993), pp. 125-142.
14. D. HARTVIGSEN, The planar multiterminal cut problem, Discrete Appl. Math., 85 (1998), pp. 203-222.
15. X. HE, An improved algorithm for the planar 3-cut problem, J. Algorithms, 12 (1991), pp. 23-37.
16. S. KAPOOR, On minimum 3-cuts and approximating k-cuts using cut trees, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 1084, Springer-Verlag, Berlin, 1996, pp. 132-146.
17. Y. KAMIDOI, S. WAKABAYASHI, AND N. YOSHIDA, Faster algorithms for finding a minimum k-way cut in a weighted graph, in Proceedings of the IEEE International Symposium on Circuits and Systems, IEEE Circuits and Systems Society, Piscataway, NJ, 1997, pp. 1009-1012.
18. Y. KAMIDOI, S. WAKABAYASHI, AND N. YOSHIDA, A divide-and-conquer approach to the minimum k-way cut problem, Algorithmica, 32 (2002), pp. 262-276.
19. D. R. KARGER, Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 1993, pp. 21-30.
20. D. R. KARGER, Minimum cuts in near-linear time, in Proceedings of the 28th ACM Symposium on Theory of Computing, ACM, New York, 1996, pp. 56-63.
21. D. R. KARGER, P. KLEIN, C. STEIN, M. THORUP, AND N. YOUNG, Rounding algorithms for a geometric embedding of minimum multiway cut, in Proceedings of the 31st ACM Symposium on Theory of Computing, ACM, New York, 1999, pp. 668-678.
22. 2) algorithm for minimum cuts, in Proceedings of the 25th ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 757-765.
23. D. R. KARGER AND C. STEIN, A new approach to the minimum cut problems, J. ACM, 43 (1996), pp. 601-640.
24. A. V. KARZANOV, Determining the maximal flow in a network by the method of preflows, Soviet Math. Dokl., 15 (1974), pp. 434-437.
25. C. H. LEE, M. KIM, AND C. I. PARK, An efficient k-way graph partitioning algorithm for task allocation in parallel computing systems, in Proceedings of the IEEE International Conference on Computer-Aided Design, IEEE Computer Society, Los Alamitos, CA, 1990, pp. 748-751.
26. T. LENGAUR, Combinatorial Algorithms for Integrated Circuit Layout, Wiley, New York, 1990.
27. M. S. LEVINE, Faster randomized algorithms for computing minimum {3,4,5,6}-way cuts, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2000, pp. 735-742.
28. H. NAGAMOCHI AND T. IBARAKI, Computing the edge-connectivity in multigraphs and capacitated graphs, SIAM J. Discrete Math., 5 (1992), pp. 54-66.
29. H. NAGAMOCHI AND T. IBARAKI, A fast algorithm for computing minimum 3-way and 4-way cuts, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 1610, Springer-Verlag, 1999, pp. 377-390.
30. H. NAGAMOCHI AND T. IBARAKI, A fast algorithm for computing minimum 3-way and 4-way cuts, Math. Program., 88 (2000), pp. 507-520.
31. H. NAGAMOCHI, S. KATAYAMA, AND T. IBARAKI, A faster algorithm for computing minimum 5-way and 6-way cuts in graphs, J. Comb. Optim., 4 (2000), pp. 151-169.
32. J. NAOR AND Y. RABANI, Tree packing and approximating k-cuts, in Proceedings of the ACMSIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2001, pp. 26-27.
33. H. SARAN AND V. V. VAZIRANI, Finding k cuts within twice the optimal, SIAM J. Comput., 24 (1995), pp. 101-108.
34. H. S. STONE, Multiprocessor scheduling with the aid of network flow algorithms, IEEE Trans. Software Engrg., 3 (1977), pp. 85-93.
35. P. TITTMANN, Partitions and network reliability, Discrete Appl. Math., 95 (1999) pp. 445-453.
36. V. VAZIRANI AND M. YANNAKAKIS, Suboptimal cuts: Their enumeration, weight, and number, in Algebraic and Logic Programming, Lecture Notes in Comput. Sci. 632, Springer-Verlag, Berlin, 1992, pp. 366-377.
37. W. C. YEH, A simple algorithm for the planar multiway put problem, J. Algorithms, 39 (2001), pp. 68-77.
38. L. ZHAO, H. NAGAMOCHI, AND T. IBARAKI, Approximating the minimum k-way cut in a graph via minimum 3-way cuts, J. Comb. Optim., 5 (2001), pp. 397-410.
39. L. ZHAO, H. NAGAMOCHI, AND T. IBARAKI, On generalized greedy splitting algorithms for multiway partition problems, Discrete Appl. Math., 143 (2004), pp. 130-143.
40. L. ZHAO, H. NAGAMOCHI, AND T. IBARAKI, Greedy splitting algorithms for approximating multiway partition problems, Math. Program., 102 (2005), pp. 167-183.