Abstract.
Let G=(V,E) be a complete undirected graph, with node set V={v 1 , . . ., v n } and edge set E . The edges (v i ,v j ) ∈ E have nonnegative weights that satisfy the triangle inequality. Given a set of integers K = { k i } i=1 p \((\sum_{i=1}^p k_i \leq |V|$) , the minimum K-cut problem is to compute disjoint subsets with sizes { k i } i=1 p , minimizing the total weight of edges whose two ends are in different subsets. We demonstrate that for any fixed p it is possible to obtain in polynomial time an approximation of at most three times the optimal value. We also prove bounds on the ratio between the weights of maximum and minimum cuts.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received September 4, 1997; revised July 15, 1998.
Rights and permissions
About this article
Cite this article
Guttmann-Beck, N., Hassin, R. Approximation Algorithms for Minimum K -Cut. Algorithmica 27, 198–207 (2000). https://doi.org/10.1007/s004530010013
Issue Date:
DOI: https://doi.org/10.1007/s004530010013