A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
An efficient K-way graph partitioning algorithm for task allocation in parallel computing systems
ISCI '90 Proceedings of the first international conference on systems integration on Systems integration '90
Finding k-cuts within twice the optimal
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
A new approach to the minimum cut problem
Journal of the ACM (JACM)
On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
IEEE Transactions on Software Engineering
Polynomial algorithm for the k-cut problem
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
A Unified Framework for Approximating Multiway Partition Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
| Hi-index | 0.00 |
For an edge weighted undirected graph G and an integer k ≥ 2, a k-way cut is a set of edges whose removal leaves G with at least k components. We propose a simple approximation algorithm to the minimum k-way cut problem. It computes a nearly optimal k-way cut by using a set of minimum 3-way cuts.We show that the performance ratio of our algorithm is 2 - 3/k for an odd k and 2 - (3k - 4)/(k2 - k) for an even k. The running time is O(kmn3 log(n2/m)) where n and m are the numbers of vertices and edges respectively.