Abstract
In this paper, we consider the node based bottleneck improvement problem for multicut (NBBIM). The objective is to upgrade a set of nodes with minimum cost such that there is a feasible multicut whose maximum weight is not more than a given value D in the upgraded network. We first show that the problem is \(\mathcal{NP}\)-hard and MaxSNP-hard for K ≥2 on general directed graphs, where K is the number of source-terminal pairs. Then we present two polynomial algorithms for a special case of problem (NBBIM) on directed MSMT trees.
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
Costa, M.C., Létocart, L., Roupin, F.: Minimal Multicut and Maximal Integer Multiflow: A Survey. European J. Oper. Res. 162, 55–69 (2005)
Garg, N., Vazirani, V.V., Yannakakis, M.: Multiway Cuts in Node Weighted Graphs. J. Algorithms 50, 49–61 (2004)
Guan, X.C., Zhang, J.Z.: A Class of Node Based Bottleneck Improvement Problems. European J. Oper. Res. Available online, May 17 (2005)
Guan, X.C., Zhang, J.Z.: Improving Multicut in Directed Trees by Upgrading Nodes. European J. Oper. Res (2005) (Accepted)
Hao, J.X., Orlin, J.B.: A Faster Algorithm for Finding the Minimum Cut in a Directed Graph. J. Algorithms 17, 424–446 (1994)
Krumke, S.O., Marathe, M.V., et al.: Approximation Algorithms for Certain Network Improvement Problems. J. Comb. Optim. 2, 257–288 (1998)
Krumke, S.O., Marathe, M.V., Noltemeier, H., et al.: Improving Minimum Cost Spanning Trees by Upgrading Nodes. J. Algorithms 33, 92–111 (1999)
Krumke, S.O., Marathe, M.V., Noltemeier, H., et al.: Upgrading Bottleneck Constrained Forests. Discrete Appl. Math. 108, 129–142 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guan, X., Su, J. (2006). Further Research on Node Based Bottleneck Improvement Problem for Multicut. In: Huang, DS., Li, K., Irwin, G.W. (eds) Intelligent Computing. ICIC 2006. Lecture Notes in Computer Science, vol 4113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816157_107
Download citation
DOI: https://doi.org/10.1007/11816157_107
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37271-4
Online ISBN: 978-3-540-37273-8
eBook Packages: Computer ScienceComputer Science (R0)