Skip to main content
SpringerLink
Log in

Steiner minimal trees for a class of zigzag lines

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Sets of points for which the Steiner minimal tree is known, are available only for some very special cases. This paper describes the Steiner minimal tree for a set of points forming the vertices of special zigzag lines.

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. R. S. Booth, Analytic formulas for full Steiner trees,Discrete Comput. Geom.,6 (1991), 69–82.

    Article  MATH  MathSciNet  Google Scholar 

  2. F. R. K. Chung, M. Gardner, and R. L. Graham, Steiner trees on a checker-board,Math. Mag.,62 (1989), 83–96.

    Article  MATH  MathSciNet  Google Scholar 

  3. F. R. K. Chung and R. L. Graham, Steiner trees for ladders,Ann. Discrete Math.,2 (1978), 173–200.

    Article  MATH  MathSciNet  Google Scholar 

  4. E. J. Cockayne, On the efficiency of the algorithm for Steiner minimal trees,SIAM J. Appl. Math.,18 (1970), 150–159.

    Article  MATH  MathSciNet  Google Scholar 

  5. E. J. Cockayne and Z. A. Melzak, Steiner's problem for set-terminals,Quart. Appl. Math.,26 (1967), 213–218.

    MathSciNet  Google Scholar 

  6. D. Z. Du and F. K. Hwang, Steiner minimal trees for bar waves,Acta Math. Appl. Sinica,3 (1987), 246–256.

    Article  MATH  Google Scholar 

  7. D. Z. Du, F. K. Hwang, and S. C. Chao, Steiner minimal trees for points on a circle,Proc. Amer. Math. Soc.,95 (1985), 613–618.

    Article  MATH  MathSciNet  Google Scholar 

  8. D. Z. Du, F. K. Hwang, G. D. Song, and G. Y. Ting, Steiner minimal trees on sets of four points,Discrete Comput. Geom.,2 (1987), 401–414.

    Article  MATH  MathSciNet  Google Scholar 

  9. D. Z. Du, F. K. Hwang, and J. F. Weng, Steiner minimal trees on zigzag lines,Trans. Amer. Math. Soc.,278 (1983), 149–156.

    Article  MATH  MathSciNet  Google Scholar 

  10. M. R. Garey, R. L. Graham, and D. S. Johnson, The complexity of computing Steiner minimal trees,SIAM J. Appl. Math.,32 (1977), 835–859.

    Article  MATH  MathSciNet  Google Scholar 

  11. E. N. Gilbert and H. O. Pollak, Steiner minimal trees,SIAM J. Appl. Math.,16 (1968), 1–29.

    Article  MATH  MathSciNet  Google Scholar 

  12. F. K. Hwang, Steiner minimal trees on the Chinese checkerboard (to appear).

  13. F. K. Hwang and J. F. Weng, The shortest network with a given topology,J. Algorithms (to appear).

  14. F. K. Hwang, J. F. Weng, and D. Z. Du, A class of full Steiner minimal trees,Discrete Math.,45 (1983), 107–112.

    Article  MATH  MathSciNet  Google Scholar 

  15. H. O. Pollak, Some remarks on the Steiner problem,J. Combin. Theory Ser. A.,24 (1978), 278–295.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Technology, The Flinders University of South Australia, G.P.O. Box 2100, 5001, Adelaide, South Australia, Australia

    R. S. Booth & J. F. Weng

Authors
  1. R. S. Booth
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. F. Weng
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by F. K. Hwang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Booth, R.S., Weng, J.F. Steiner minimal trees for a class of zigzag lines. Algorithmica 7, 231–246 (1992). https://doi.org/10.1007/BF01758760

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation