Skip to main content
SpringerLink
Log in

Optimal Capacity Expansion Arc Algorithm on Networks

  • Conference paper
Computational and Information Science (CIS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3314))

Included in the following conference series:

  • 1198 Accesses

Abstract

The problem of the capacity expansion of a network by means of expanding the capacity of its arcs is elaborated in this paper. By using the theory and algorithm of the maximum flow, the minimum cut-set and the bottleneck of the network can be found, then the expansible arcs are sought according to whether there exists any augmenting path in the minimum cut-set. If the expansible arcs exist,the capacity of the network can be expanded by means of expanding the capacity of those arcs to increase the maximum flow. In order to fulfill the goal, the algorithms of the expansible arc and the optimal expansion arc are presented and the complexity analyses of those algorithms are given as well.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Balakrishnam, V.K.: Network Optimization. Chapman & Hall, London (1995)

    Google Scholar 

  2. Ahujia, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows:Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)

    Google Scholar 

  3. Ford, L.R., Fulkerson, D.R.: Maximum flow through a network. Canadian Journal of Math. 8(5), 399–404 (1956)

    Article  MATH  MathSciNet  Google Scholar 

  4. Andrew, V., Goldberg, S.R.: Flows in Undirected Unit Capacity Networks. SIAM Journal on Discrete Mathematics 12, 1–5 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  5. Zhang, J., Yang, C., Lin, Y.: A class of bottleneck expansion problems. Computer Operate Research 286, 505–519 (2001)

    Article  Google Scholar 

  6. Yu, S., Liu, Y., Mao, J., Xu, K.: Algorithm of capacity expansion networks on optimization. Chinese Science Bulletin 48(10), 1047–1050 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Huazhong, University of Science and Technology, Wuhan, 430074, China

    Yuhua Liu & Shengsheng Yu

  2. Department of Computer Science, Central China Normal University, Wuhan, 430079, China

    Yuhua Liu & Peng Yang

  3. Department of Mathematics, Central China Normal University, Wuhan, 430079, China

    Jingzhong Mao

Authors
  1. Yuhua Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shengsheng Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jingzhong Mao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Peng Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electronic Science and Technology, Anhui University, Hefei, Anhui, China

    Jun Zhang

  2. College of Science, Donghua University, 1882 Yan’an Xilu Road, 20051, Shanghai, China

    Ji-Huan He

  3. BASICS, Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200030, Shanghai, China

    Yuxi Fu

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, Y., Yu, S., Mao, J., Yang, P. (2004). Optimal Capacity Expansion Arc Algorithm on Networks. In: Zhang, J., He, JH., Fu, Y. (eds) Computational and Information Science. CIS 2004. Lecture Notes in Computer Science, vol 3314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30497-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30497-5_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24127-0

  • Online ISBN: 978-3-540-30497-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation