Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 1994: Algorithms — ESA '94 pp 60–71Cite as

Approaching the 5/4 — approximation for rectilinear Steiner trees

  • Conference paper
  • First Online:

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

Abstract

The rectilinear Steiner tree problem requires to find a shortest tree connecting a given set of terminal points in the plane with rectilinear distance. We show that the performance ratios of Zelikovsky's[17] heuristic is between 1.3 and 1.3125 (before it was only bounded from above by 1.375), while the performance ratio of the heuristic of Berman and Ramaiyer[1] is at most 1.271 (while the previous bound was 1.347). Moreover, we provide O(n · log2 n)-time algorithms that satisfy these performance ratios.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Berman, V. Ramaiyer. Improved approximations for the Steiner tree problem. In Proc. of 3d ACM-SIAM Symp. on Discrete Algorithms, 325–334, 1992.

    Google Scholar 

  2. P. Berman, U. Fößmeier, M. Karpinski, M. Kaufmann, A. Zelikovsky. Approaching the 5/4-Approximations for Rectilinear Steiner Trees. Techn. Rep. WSI-94-6, Tübingen.

    Google Scholar 

  3. D. Du, Y. Zhang, Q. Feng. On better heuristic for Euclidean Steiner minimum trees. 32nd IEEE Symp. on Found, of Comp. Science, 431–439, 1991.

    Google Scholar 

  4. D. Eppstein, et al. Maintaining of a Minimum Spanning Forest in a Dynamic Planar Graph. Proceedings, 1st ACM-SIAM Symp. on Discrete Algorithms, 1–11, 1990.

    Google Scholar 

  5. U. Fößmeier, M. Kaufmann, A. Zelikovsky. Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. LNCS 762, 533–542, 1993.

    Google Scholar 

  6. G. Frederickson. Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications. SIAM J. Comp., 14, 781–789, 1985.

    MATH  MathSciNet  Google Scholar 

  7. M. R. Garey, D. S. Johnson. The Rectilinear Steiner Problem is NP-Complete. SIAM J. Appl. Math., 32, 826–834, 1977.

    MathSciNet  Google Scholar 

  8. E. N. Gilbert, H. O. Pollak. Steiner Minimal Trees. SIAM Appl. Math., 16, 1–29, 1968.

    MathSciNet  Google Scholar 

  9. M. Hanan. On Steiner's Problem with Rectilinear Distance. SIAM J. Appl. Math., 14, 255–265, 1966.

    Article  MATH  MathSciNet  Google Scholar 

  10. F. K. Hwang. On Steiner Minimal Trees with Rectilinear Distance. SIAM J. Appl. Math., 30, 104–114, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  11. F. K. Hwang, D. S. Richards, P. Winter. The Steiner Tree Problem. Annals of Disc. Math. 53, 1992.

    Google Scholar 

  12. R. M. Karp. Reducibility among combinatorial problems. In Miller and Thatcher (eds.), Complexity of Computer Computations, Plenum Press, 85–103, 1972.

    Google Scholar 

  13. B.Korte, H.J.Prömel, A.Steger. Steiner Trees in VLSI-Layouts. In Korte et al.: Paths, Flows and VLSI-Layout, Springer, 1990.

    Google Scholar 

  14. Th. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. John Wiley, 1990.

    Google Scholar 

  15. D. Richards. Fast Heuristic Algorithms for Rectilinear Steiner Trees. Algorithmica, 4, 191–207, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  16. H. Takahashi, A. Matsuyama. An approximate solution for the Steiner problem in graphs. Math. Japonica, 24: 573–577, 1980.

    MathSciNet  Google Scholar 

  17. A. Z. Zelikovsky. An 11/8-approximation Algorithm for the Steiner Problem on Networks with Rectilinear Distance. In Coll. Math. Soc. J. Bolyai 60: 733–745, 1992.

    MATH  MathSciNet  Google Scholar 

  18. A.Z. Zelikovsky. A Faster Approximation Algorithm for the Steiner Tree Problem in Graphs. Inf. Process. Lett. 46: 79–83, 1993.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Piotr Berman

  2. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, 72076, Tübingen, Germany

    Ulrich Fößmeier & Michael Kaufmann

  3. Department of Computer Science, Universität Bonn, Römerstraße 164, 53117, Bonn, Germany

    Marek Karpinski

  4. Institute of Mathematics, Akademiei 5, 277028, Kishinev, Moldova

    Alexander Zelikovsky

Authors
  1. Piotr Berman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ulrich Fößmeier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marek Karpinski
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Michael Kaufmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Alexander Zelikovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berman, P., Fößmeier, U., Karpinski, M., Kaufmann, M., Zelikovsky, A. (1994). Approaching the 5/4 — approximation for rectilinear Steiner trees. In: van Leeuwen, J. (eds) Algorithms — ESA '94. ESA 1994. Lecture Notes in Computer Science, vol 855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049397

Download citation

  • DOI: https://doi.org/10.1007/BFb0049397

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58434-6

  • Online ISBN: 978-3-540-48794-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation