Approximation Algorithms for Minimum K-cut 7英文电子资料.pdfVIP

Approximation algorithms for minimum K cut Nili GuttmannBeck and Refael Hassin 1 Abstract Let G V E b e a complete undirected graph with no de set V fv v g and 1 n edge set E The edges v v E have nonnegative weights that satisfy the triangle i j P p p inequality Given a set of integers K fk g k jV j the minimum Kcut i i =1 i =1 i p pr oblem is to compute disjoint subsets with sizes fk g minimizing the total weight i i =1 of edges whose two ends are in dierent subsets We demonstrate that for any xed p it is p ossible to obtain in p olynomial time an approximation of at most times the optimal value We also prove b ounds on the ratio b etween the weights of maximum and minimum cuts Intro duction Let G V E b e a complete undirected graph with nonnegative edge weights l e e E P p such that p k jV j A Kcut is a collec and let K b e a set of p p ositive integers fk g i i i =1 i =1 p tion of disjoint sets fP g such that i f pg jP j k The minimum Kcut pr oblem i i =1