Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Frontiers in Algorithmics

FAW 2007: Frontiers in Algorithmics pp 317–324Cite as

Some New Structural Properties of Shortest 2-Connected Steiner Networks

  • Conference paper

  • 610 Accesses

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

Abstract

In this paper we give a number of structural results for the problem of constructing minimum-weight 2-connected Steiner networks for a set of terminals in a graph and in the plane. A sufficient condition for a minimum-weight 2-connected Steiner network on a set of points in the plane to be basic is also obtained. Using the structural results, we show that the minimum-weight 2-connected Steiner network on a set of terminals Z is either a minimum-weight 2-connected spanning network on Z or isomorphic to one of several specific networks when |Z| = 6 or 7.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Grötschel, M., Monma, C.L., Stoer, M.: Design of survivable networks. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Models, Handbook in Operations Research and Management Sciences Series, pp. 617–672. North-Holland, New York (1995)

    Google Scholar 

  2. Hsu, D.F., Hu, X.-D.: On shortest two-connected Steiner networks with Euclidean distance. Networks 32(2), 133–140 (1998)

    Article  MATH  Google Scholar 

  3. Luebke, E.L.: K-connected Steiner network problems, PhD Thesis, University of North Carolina, USA (2002)

    Google Scholar 

  4. Luebke, E.L., Provan, J.S.: On the structure and complexity of the 2-connected Steiner network problem in the plane. Oper. Res. Lett. 26, 111–116 (2000)

    Article  MATH  Google Scholar 

  5. Monma, C.L., Munson, B.S., Pulleyblank, W.R.: Minimum-weight two-connected spanning networks. Math. Prog. 46, 153–171 (1990)

    Article  MATH  Google Scholar 

  6. Winter, P., Zachariasen, M.: Two-connected Steiner networks: structural properties. Oper. Res. Lett. 33, 395–402 (2005)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Science, Tianjin Polytechnic University, Tianjin 300160, P.R. China

    Shuying Peng

  2. Department of Mathematics, Xi’an Shiyou University, Xi’an, Shaanxi 710065, P.R. China

    Meili Li

  3. Department of Applied Mathematics, Northwestern Polytechnical University, Xi’an, Shaanxi 710072, P.R. China

    Shenggui Zhang

  4. Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, P.R. China

    Shenggui Zhang & T. C. Edwin Cheng

Authors
  1. Shuying Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Meili Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shenggui Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. T. C. Edwin Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franco P. Preparata Qizhi Fang

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peng, S., Li, M., Zhang, S., Cheng, T.C.E. (2007). Some New Structural Properties of Shortest 2-Connected Steiner Networks. In: Preparata, F.P., Fang, Q. (eds) Frontiers in Algorithmics. FAW 2007. Lecture Notes in Computer Science, vol 4613. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73814-5_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73814-5_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73813-8

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation