Title :
Finding k-cuts within twice the optimal
Author :
Saran, Huzur ; Vazirani, Vijay V.
Author_Institution :
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
Keywords :
approximation theory; computational complexity; graph theory; minimisation; approximation algorithms; maximum flow computations; minimum k-cut problem; weight; Approximation algorithms; Computer science; Helium; Partitioning algorithms; Polynomials; Very large scale integration;
Conference_Titel :
Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on
Conference_Location :
San Juan
Print_ISBN :
0-8186-2445-0
DOI :
10.1109/SFCS.1991.185443
