The Community for Technology Leaders
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science (1991)
San Juan, Puerto Rico
Oct. 1, 1991 to Oct. 4, 1991
ISBN: 0-8186-2445-0
pp: 743-751
H. Saran , Dept. of Comput. Sci.&Eng., Indian Inst. of Tech., New Delhi, India
V.V. Vazirani , Dept. of Comput. Sci.&Eng., Indian Inst. of Tech., New Delhi, India
ABSTRACT
Two simple approximation algorithms are presented for the minimum k-cut problem. Each algorithm finds a k-cut having weight within a factor of (2-2/k) of the optimal. One of the algorithms is particularly efficient, requiring a total of only n-1 maximum flow computations for finding a set of near-optimal k-cuts, one for each value of k between 2 and n.
INDEX TERMS
maximum flow computations, approximation algorithms, minimum k-cut problem, weight
CITATION

V. Vazirani and H. Saran, "Finding k-cuts within twice the optimal," [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science(FOCS), San Juan, Puerto Rico, 1991, pp. 743-751.
doi:10.1109/SFCS.1991.185443
88 ms
(Ver 3.3 (11022016))