Skip to main content
SpringerLink
Log in

A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2

  • Conference paper
Algorithms and Computation (ISAAC 2010)

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

Included in the following conference series:

  • 1157 Accesses

Abstract

Given a graph with edge lengths and a set of pairs of vertices which should be connected (requirements) the Generalized Steiner Tree Problem (GSTP) asks for a minimum length subgraph that connects every requirement. For the Generalized Steiner Tree Problem restricted to complete graphs with edge lengths 1 and 2, we provide a 1.5-approximation algorithm. It is the first algorithm with the approximation ratio significantly better than 2 for a class of graphs for which GSTP is MAX SNP-hard.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, A., Klein, P.N., Ravi, R.: When trees collide: An approximation algorithm for the generalized Steiner tree problem on networks. In: STOC, pp. 134–144 (1991)

    Google Scholar 

  2. Berman, P., Karpinski, M., Zelikovsky, A.: 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2. In: Dehne, F., et al. (eds.) WADS 2009. LNCS, vol. 5664, pp. 86–97. Springer, Heidelberg (2009)

    Google Scholar 

  3. Bern, M., Plassmann, P.: The Steiner problem with edge lengths 1 and 2. Information Processing letters 32, 171–176 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  4. Byrka, J., Grandoni, F., Rothvoß, T., Sanità, L.: An improved LP-based approximation for Steiner tree. In: STOC (to appear, 2010)

    Google Scholar 

  5. Czumaj, A., Lingas, A., Zhao, H.: Polynomial-time approximation schemes for the Euclidean survivable network design problem. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 973–984. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Rayward-Smith, V.J.: The computation of nearly minimal Steiner trees in graphs. Internat. J. Math. Educ. Sci. Tech. 14, 15–23 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  7. Robins, A.Z.: Tighter Bounds for Graph Steiner Tree Approximation. SIAM Journal on Discrete Mathematics 19(1), 122–134 (2005); Preliminary version appeared in Proc. SODA 2000, pp. 770–779 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, Pennsylvania State University, University Park, PA, 16802, USA

    Piotr Berman

  2. Department of Computer Science, University of Bonn, 53117, Bonn, Germany

    Marek Karpinski

  3. Department of Computer Science, Georgia State University, Atlanta, GA, 30303, USA

    Alexander Zelikovsky

Authors
  1. Piotr Berman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marek Karpinski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexander Zelikovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, KAIST, Gwahangno 335, 305-701, Yuseong-gu, Daejeon, Korea

    Otfried Cheong  & Kyung-Yong Chwa  & 

  2. School of Computer Science and Engineering, Seoul National University, 151-742, Seoul, Korea

    Kunsoo Park

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berman, P., Karpinski, M., Zelikovsky, A. (2010). A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2. In: Cheong, O., Chwa, KY., Park, K. (eds) Algorithms and Computation. ISAAC 2010. Lecture Notes in Computer Science, vol 6506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17517-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17517-6_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17516-9

  • Online ISBN: 978-3-642-17517-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation