Let k be an input parameter. An s-t cut is of k-size if its s-side has size at most k. The Min k-Size s-t Cut problem asks to find a k-size s-t cut with the minimum capacity. Being the unbalanced version of the famous Min s-t Cut problem, this problem is fundamental and has extensive applications, especially in community identification in social and information networks. In this paper, we give a new k+1/k+1-k*-approximation algorithm for the Min k-Size s-t Cut problem, where k* is the size of s-side of an optimal solution. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
Zhang, P. (2014). A new approximation algorithm for the unbalanced min s-t cut problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8591 LNCS, pp. 346–356). Springer Verlag. https://doi.org/10.1007/978-3-319-08783-2_30
Mendeley helps you to discover research relevant for your work.