Abstract
Given a graph with labels defined on edges and a source-sink pair (s, t), the Label s-t Cut problem asks a minimum number of labels such that the removal of edges with these labels disconnects s and t. Similarly, the Global Label Cut problem asks a minimum number of labels such that its removal disconnects G itself. For these two problems we give some efficient algorithms that are useful in practice. In particular, we give a combinatorial l max -approximation algorithm for the Label s-t Cut problem, where l max is the maximum s-t length. We show the Global Label Cut problem is polynomial-time solvable in several special cases, including graphs with bounded treewidth, planar graphs, and instances with bounded label frequency.
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
Coudert, D., Datta, P., Perennes, S., Rivano, H., Voge, M.E.: Shared risk resource group: complexity and approximability issues. Parallel Processing Letters 17, 169–184 (2007)
Fellows, M., Guo, J., Kanj, I.: The parameterized complexity of some minimum label problems. Journal of Computer and System Sciences 76(8), 727–740 (2010)
Jegelka, S., Bilmes, J.: Cooperative cuts: graph cuts with submodular edge weights. Technical Report TR-189 (2010)
Jha, S., Sheyner, O., Wing, J.M.: Two formal analyses of attack graphs. In: Proceedings of the 15th IEEE Computer Security Foundations Workshop (CSFW), pp. 49–63. IEEE Computer Society (2002)
Sheyner, O., Haines, J., Jha, S., Lippmann, R., Wing, J.: Automated generation and analysis of attack graphs. In: Proceedings of the IEEE Symposium on Security and Privacy, Oakland, CA, pp. 273–284 (2002)
Tang, L., Zhang, P.: Approximating minimum label s-t cut via linear programming. In: Fernández-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 655–666. Springer, Heidelberg (2012)
Zhang, P., Cai, J.Y., Tang, L., Zhao, W.: Approximation and hardness results for label cut and related problems. Journal of Combinatorial Optimization 21(2), 192–208 (2011)
Karp, R.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)
Papadimitriou, C.: Computational Complexity. Addison-Wesley Publishing Company, Inc. (1994)
Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43, 425–440 (1991)
Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2 − ε. Journal of Computer and System Sciences 74(3), 335–349 (2008)
Kleinberg, J., Tardos, E.: Algorithm design. Addison-Wesley (2006)
Karger, D., Stein, C.: A new approach to the minimum cut problem. Journal of the ACM 43(4), 601–640 (1996)
Nagamochi, H., Nishimura, K., Ibaraki, T.: Computing all small cuts in an undirected network. SIAM Journal on Discrete Mathematics 10(3), 469–481 (1997)
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). Efficient Algorithms for the Label Cut Problems. In: Gopal, T.V., Agrawal, M., Li, A., Cooper, S.B. (eds) Theory and Applications of Models of Computation. TAMC 2014. Lecture Notes in Computer Science, vol 8402. Springer, Cham. https://doi.org/10.1007/978-3-319-06089-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-06089-7_18
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06088-0
Online ISBN: 978-3-319-06089-7
eBook Packages: Computer ScienceComputer Science (R0)