Skip to main content
SpringerLink
Log in

New Approximation Algorithms for the Steiner Tree Problems

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

The Steiner tree problem asks for the shortest tree connecting a given set of terminal points in a metric space. We design new approximation algorithms for the Steiner tree problems using a novel technique of choosing Steiner points in dependence on the possible deviation from the optimal solutions. We achieve the best up to now approximation ratios of 1.644 in arbitrary metric and 1.267 in rectilinear plane, respectively.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Berman, P., and V. Ramaiyer. (1991). “An approximation algorithm for the Steiner tree problem.” The Pennsylvania State University, PA, Technical Report #CS-91-05.

    Google Scholar 

  • Berman, P., and V. Ramaiyer. (1994). “Improved approximations for the Steiner tree problem,” J. of Algorithms vol. 17 pp. 381–408.

    Google Scholar 

  • Berman, P., U. Fößmeier, M. Karpinski, M. Kaufmann, and A. Zelikovsky. (1994). “Approaching the 5/4-Approximations for Rectilinear Steiner Trees,” LNCS vol. 855, Springer-Verlag, pp. 60–71, 1994.

  • Bern, M., and D. Eppstein. (1995), “Approximation Algorithms for Geometric Problems,” in D. Hochbaum, (ed.), Approximation Algorithms for NP-Complete Problems, PWS Publications. (to appear)

  • Bern, M., and P. Plassmann. (1989). “The Steiner problems with edge lengths 1 and 2,” lnform. Process. Lett. vol. 32 pp. 171–176.

    Google Scholar 

  • Borchers, A., and D. Du. (1995). “The k-Steiner Ratio in Graphs,” Proc. 27th ACM STOC (1995), pp. 641–649.

  • Du, D., Y. Zhang, and Q. Feng. (1991). “On better heuristic for Euclidean Steiner minimum trees,” in Proc. 32nd IEEE Symp. on Found. of Comp. Science, pp. 43l–439.

  • Fößmeier, U., M. Kaufmann, and A. Zelikovsky. (1993). “Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem,” LNCS vol. 762, Springer-Verlag, pp. 533–542.

  • Garey, M. R., and D. S. Johnson. (1977). “The Rectilinear Steiner Problem is NP-Complete,” SIAM J. Appl. Math. Vol. 32 pp. 826–834.

    Google Scholar 

  • Gilbert, E. N., and H. O. Pollak. (1968). “Steiner Minimal Trees,” SIAM Appl. Math. vol. 16 pp. 1–29.

    Google Scholar 

  • Hwang, F. K. (1976). “On Steiner Minimal Trees with Rectilinear Distance,” SIAM J. Appl. Math. vol. 30 pp. 104–114.

    Google Scholar 

  • Hwang, F. K. (1979). “An o(n log n) algorithm for rectilinear minimum spanning trees,” J. ACM vol. 26 pp. 177–182.

    Google Scholar 

  • Hwang, F. K., D. Richards, and P. Winter. (1992). The Steiner Tree Problem, Annals of Disc. Math. vol. 53.

  • Karpinski, M., and A. Zelikovsky. (1995). “1.757 and 1.267-Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems.” International Computer Science Institute, Berkeley, CA, Technical Report TR-95010.

    Google Scholar 

  • Khang, A. B., and G. Robins, (1995). On optimal interconnections for VLSI, Kluwer Academic Publishers, Boston. MA.

    Google Scholar 

  • Korte, B., H. J. Prömel, and A. Steger. (1990). “Steiner Trees in VLSI-Layouts.” in Korte et al. (eds.): Paths, Flows and VLSI-Layout, Springer.

  • Mehlhorn, K. (1988), “A faster approximation algorithm for the Steiner problem in graphs”Inf. Process. Lett. vol. 27 pp. 125–128.

    Google Scholar 

  • Salowe, J. S., and D. M. Warme. (1993). “An exact rectilinear Steiner tree algorithm,” in Proc. of the lnt. Conf. on Comp. Design, pp. 472–475.

  • Takahashi, H., and A. Matsuyama. (1980), “An approximate solution for the Steiner problem in graphs.” Math. Japonica vol. 24 pp. 573–577.

    Google Scholar 

  • Zelikovsky, A. Z. (1993). “An 1l/6-approximation Algorithm for the network Steiner Problem,” Algorithmica vol. 9 pp. 463–470.

    Google Scholar 

  • Zelikovsky, A. Z. (1992). “An 1l/8-approximation Algorithm for the Steiner Problem on Networks with Rectilinear Distance,” in Coll. Math. Soc. J. Bolyai vol. 60 pp. 733–745.

    Google Scholar 

  • Zelikovsky, A. Z. (1993). “A faster approximation algorithm for the Steiner Tree Problem in Graphs,” lnf. Process. Lett. vol. 46 pp. 79–83.

    Google Scholar 

  • Zelikovsky, A. Z. (1995). “Better approximation bounds for the network and Euclidean Steiner tree problems,” Manuscript.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bonn, 53117, Bonn, and

    Marek Karpinski

  2. International Computer Science Institute, Berkeley, California, Email

    Marek Karpinski

  3. Department of Computer Science, Thornton Hall, University of Virginia, VA, 22903-2442, Email

    Alexander Zelikovsky

Authors
  1. Marek Karpinski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander Zelikovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Karpinski, M., Zelikovsky, A. New Approximation Algorithms for the Steiner Tree Problems. Journal of Combinatorial Optimization 1, 47–65 (1997). https://doi.org/10.1023/A:1009758919736

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009758919736

Keywords

Search

Navigation