Abstract
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 \(\frac{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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Leskovec, J., Lang, K., Dasgupta, A., Mahoney, M.: Statistical properties of community structure in large social and information networks. In: Proceedings of the 17th International World Wide Web Conference (WWW), pp. 695–704 (2008)
Li, A., Zhang, P.: Unbalanced graph partitioning. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part I. LNCS, vol. 6506, pp. 218–229. Springer, Heidelberg (2010)
Räcke, H.: Optimal hierarchical decompositions for congestion minimization in networks. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 255–264 (2008)
Hayrapetyan, A., Kempe, D., Pál, M., Svitkina, Z.: Unbalanced graph cuts. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 191–202. Springer, Heidelberg (2005)
Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM Journal on Computing 18(1), 30–55 (1989)
Feige, U., Krauthgamer, R., Nissim, K.: On cutting a few vertices from a graph. Discrete Applied Mathematics 127, 643–649 (2003)
Karger, D., Stein, C.: A new approach to the minimum cut problem. Journal of the ACM 43(4), 601–640 (1996)
Armon, A., Zwick, U.: Multicriteria global minimum cuts. Algorithmica 46(1), 15–26 (2006)
Nagamochi, H., Nishimura, K., Ibaraki, T.: Computing all small cuts in an undirected network. SIAM Journal on Discrete Mathematics 10(3), 469–481 (1997)
Fomin, F., Golovach, P., Korhonen, J.: On the parameterized complexity of cutting a few vertices from a graph. CoRR abs/1304.6189 (2013)
Chuzhoy, J., Makarychev, Y., Vijayaraghavan, A., Zhou, Y.: Approximation algorithms and hardness of the k-route cut problem. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 780–799 (2012)
Svitkina, Z., Tardos, É.: Min-max multiway cut. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX and RANDOM 2004. LNCS, vol. 3122, pp. 207–218. Springer, Heidelberg (2004)
Eisner, M.J., Severance, D.G.: Mathematical techniques for efficient record segmentation in large shared databases. Journal of the ACM 23, 619–635 (1976)
Stone, H.S.: Critical load factors in two-processor distributed systems. IEEE Transactions on Software Engineering 4, 254–258 (1978)
Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. Journal of the ACM 35(4), 921–940 (1988)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimizatoin: Algorithms and Complexity. Dover Publications, Inc., Mineola (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Zhang, P. (2014). A New Approximation Algorithm for the Unbalanced Min s-t Cut Problem. In: Cai, Z., Zelikovsky, A., Bourgeois, A. (eds) Computing and Combinatorics. COCOON 2014. Lecture Notes in Computer Science, vol 8591. Springer, Cham. https://doi.org/10.1007/978-3-319-08783-2_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-08783-2_30
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08782-5
Online ISBN: 978-3-319-08783-2
eBook Packages: Computer ScienceComputer Science (R0)