Skip to main content
SpringerLink
Log in

A practical algorithm for the minimum rectilinear steiner tree

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

AnO(n 2) time approximation algorithm for the minimum rectilinear Steiner tree is proposed. The approximation ratio of the algorithm is strictly less than 1.5. The computing performances show the costs of the spanning trees produced by the algorithm are only 0.8% away from the optimal ones.

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

  1. Hwang F K, Richards D S, Winter P. The Steiner Tree Problem. The Netherlands, North-Holland, 1992, pp.20–200.

    MATH  Google Scholar 

  2. Hanan M. On Steiner’s problem with rectilinear distance.SIAM J. Applied Math., 1966, 14(5): 255–265.

    Article  MATH  MathSciNet  Google Scholar 

  3. Synder T L. A simple and faster algorithm for the rectilinear Steiner problem in general dimension. InProc. ACM Symp. Computational Geometry, 1990, pp.1340–1345.

  4. Kahng A B, Robins G. A new class of iterative Steiner tree heuristics with good performance.IEEE Trans. Computer Aided Design, 1992, 11(7): 893–902.

    Article  Google Scholar 

  5. Kruskal J B. On the shortest spanning tree of a graph and the traveling salesman problem. InProc. Amer. Math. Soc., 1956, pp.48–50.

  6. Salowe J S, Warme D M. An exact rectilinear Steiner tree algorithm.In Proc. IEEE Int. Conf. Computer Design. Cambridge, MA, Oct. 1993, pp.472–475.

  7. Já Já J. An Introduction to Parallel Algorithms. Addison-Wesley Publishing Company, 1992.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Shandong University, 250100, Jinan, P.R. China

    Ma Jun, Yang Bo & Ma Shaohan

Authors
  1. Ma Jun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yang Bo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ma Shaohan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ma Jun.

Additional information

This research was supported in part by the National ‘863-306’ High-Tech Program and the National Natural Science Foundation of China.

MA Jun received the Ph.D. degree in computer science from Kyushu University of Japan in 1987. Now he is a Professor of Shandong University. His research interests include the analysis of algorithms, parallel computation and artificial intelligence.

YANG Bo received his B.S. degree in computer science from Shandong University in 1997. Now he is a postgraduate student at Shandong University. His research interests include database and analysis of algorithms.

MA Shaohan graduated from Shandong University in 1962. He is a Professor at the Department of Computer Science of Shandong University. His research interests include the analysis of algorithms, parallel computation and artificial intelligence.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ma, J., Yang, B. & Ma, S. A practical algorithm for the minimum rectilinear steiner tree. J. Comput. Sci. & Technol. 15, 96–99 (2000). https://doi.org/10.1007/BF02951931

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation