Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts
暂无分享,去创建一个
[1] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[2] Sanjiv Kapoor,et al. On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees , 1996, IPCO.
[3] Myunghwan Kim,et al. An efficient k-way graph partitioning algorithm for task allocation in parallel computing systems , 1990, Systems Integration '90. Proceedings of the First International Conference on Systems Integration.
[4] David R. Karger,et al. A new approach to the minimum cut problem , 1996, JACM.
[5] Dorit S. Hochbaum,et al. Polynomial algorithm for the k-cut problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[6] Harold S. Stone,et al. Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.
[7] Vijay V. Vazirani,et al. Finding k-cuts within twice the optimal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[8] Thomas Lengauer,et al. Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.
[9] Mihalis Yannakakis,et al. The Complexity of Multiterminal Cuts , 1994, SIAM J. Comput..
[10] Toshihide Ibaraki,et al. A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs , 1999, J. Comb. Optim..
[11] Toshihide Ibaraki,et al. A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts , 1999, IPCO.