Skip to main content
SpringerLink
Log in

Further Research on Node Based Bottleneck Improvement Problem for Multicut

  • Conference paper
Book cover Intelligent Computing (ICIC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4113))

Included in the following conference series:

  • 1604 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Costa, M.C., Létocart, L., Roupin, F.: Minimal Multicut and Maximal Integer Multiflow: A Survey. European J. Oper. Res. 162, 55–69 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Garg, N., Vazirani, V.V., Yannakakis, M.: Multiway Cuts in Node Weighted Graphs. J. Algorithms 50, 49–61 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Guan, X.C., Zhang, J.Z.: A Class of Node Based Bottleneck Improvement Problems. European J. Oper. Res. Available online, May 17 (2005)

    Google Scholar 

  4. Guan, X.C., Zhang, J.Z.: Improving Multicut in Directed Trees by Upgrading Nodes. European J. Oper. Res (2005) (Accepted)

    Google Scholar 

  5. Hao, J.X., Orlin, J.B.: A Faster Algorithm for Finding the Minimum Cut in a Directed Graph. J. Algorithms 17, 424–446 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  6. Krumke, S.O., Marathe, M.V., et al.: Approximation Algorithms for Certain Network Improvement Problems. J. Comb. Optim. 2, 257–288 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  7. Krumke, S.O., Marathe, M.V., Noltemeier, H., et al.: Improving Minimum Cost Spanning Trees by Upgrading Nodes. J. Algorithms 33, 92–111 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Krumke, S.O., Marathe, M.V., Noltemeier, H., et al.: Upgrading Bottleneck Constrained Forests. Discrete Appl. Math. 108, 129–142 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Math., Southeast University, Nanjing, 210096, P.R. China

    Xiucui Guan

  2. Sch. of Bus., Renmin University of China, Beijing

    Jie Su

  3. Sch. of Math. and Sys. Sci., Shandong University, Jinan, P.R. China

    Jie Su

Authors
  1. Xiucui Guan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jie Su
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Intelligent Machines, Chinese Academy of Sciences, Hefei, Anhui, China

    De-Shuang Huang

  2. Carnegie Mellon University,  

    Kang Li

  3. School of Electronics, Electrical Engineering and Computer Science, Queen’s University Belfast, Stranmillis Road, BT9 5AH, Belfast, UK

    George William Irwin

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation