Skip to main content
SpringerLink
Log in

A primer of the Euclidean Steiner problem

  • Section I General Topological Network Design
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We give an up-to-date survey on the Euclidean Steiner problem which deals with the construction of a shortest network interconnecting a given set of points in the Euclidean plane.

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. M. Ajtai, V. Chvatal, M.M. Newborn and E. Szemeredi, Crossing free subgraphs, Ann. Discr. Math. 12(1982)1–12.

    Google Scholar 

  2. J. Beardwood, J.H. Halton and J.M. Hammersley, The shortest path through many points, Proc. Cambridge Phil. Soc. 55(1959)299–327.

    Google Scholar 

  3. M.W. Bern and R.L. Graham, The shortest-network problem, Sci. Amer. (Jan. 1989)84–89.

  4. J.E. Beasley, A heuristic for the Euclidean and rectilinear Steiner tree problem, Working Paper, Managament School, Imperial College (1989).

  5. R.S. Booth, Analytic formulas for full Steiner trees, Discr. Comput. Geom., to appear.

  6. R.S. Booth, The Steiner ratio for five points, Ann. Oper. Res., this volume.

  7. R.S. Booth and J.F. Weng, Steiner minimal trees for a class of zigzag lines, Algorithmica, to appear.

  8. W.M. Boyce and J.B. Seery, STEINER 72: An improved version of the minimal network problem, Memo,Bell Laboratories (1972).

  9. W.M. Boyce, J.B. Seery and J.B. Goodman, Improved solutions for some minimal-network test problems, Memo, Bell Laboratories (1973).

  10. S.K. Chang, The generation of minimal trees with a Steiner topology, J. ACM 19(1972)699–711.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  13. F.R.K. Chung and R.L. Graham, On Steiner trees for bounded point sets, Geometriae Dedicata 11(1981)353–361.

    Google Scholar 

  14. F.R.K. Chung and R.L. Graham, A new bound for Euclidean Steiner minimal trees, Ann. N.Y. Acad. Sci. 440(1985)325–346.

    Google Scholar 

  15. F.R.K. Chung and F.K. Hwang, A lower bound for the Steiner tree problem, SIAM J. Appl. Math. 34(1978)27–36.

    Google Scholar 

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

    Google Scholar 

  17. E.J. Cockayne and D.E. Hewgill, Exact computation of Steiner minimal trees in the plane, Inf. Proc. Lett. 22(1986)151–156.

    Google Scholar 

  18. E.J. Cockayne and D.E. Hewgill, Leaf paths of full Steiner trees and computation of planar Steiner minimal trees, Preprint (1989).

  19. E.J. Cockayne and D.G. Schiller, Computation of Steiner minimal trees, in:Combinatorics, ed. D.J.A. Welsh and D.R. Woodall (Int. Math. Appl., 1972), pp. 53–71.

  20. D.Z. Du and F.K. Hwang, A new bound for the Steiner ratio, Trans. Amer. Math. Soc. 278(1983)137–148.

    Google Scholar 

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

    Google Scholar 

  22. D.Z. Du and F.K. Hwang, A proof of the Gilbert-Pollak conjecture on the Steiner ratio, Algorithmica, to appear.

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

    Google Scholar 

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

    Google Scholar 

  25. D.Z. Du, F.K. Hwang and J.F. Weng, Steiner minimal trees on regular polygons, Discr. Comput. Geom. 2(1987)65–87.

    Google Scholar 

  26. D.Z. Du, F. K. Hwang and E.N. Yao, The Steiner ratio conjecture is true for five points, J. Combin. Theory Ser. A 38(1985)230–240.

    Google Scholar 

  27. D.Z. Du, E.N. Yao and F.K. Hwang, A short proof of a result of Pollak on Steiner minimal trees, J. Combin. Theory Ser. A 32(1982)356–400.

    Google Scholar 

  28. J. Friedel and P. Widmayer, A simple proof of the Steiner ratio conjecture for five points, SIAM J. Appl. Math. 49(1989)960–967.

    Google Scholar 

  29. L. Few, The shortest path and shortest road throughn points, Mathematika 2(1955)141–144.

    Google Scholar 

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

    Google Scholar 

  31. R.L. Graham, Some results on Steiner minimal trees, Memo, Bell Laboratories (1967).

  32. R.L. Graham and F.K. Hwang, Remarks on Steiner minimal trees I, Bull. Inst. Math. Acad. Sinica 4(1976)177–182.

    Google Scholar 

  33. E.N. Gilbert and H.O. Pollak, Steiner minimal trees, SIAM J. Appl. Math. 16(1968)323–345.

    Google Scholar 

  34. F.K. Hwang, A linear time algorithm for full Steiner trees, Oper. Res. Lett. 5(1986)235–237.

    Google Scholar 

  35. F.K. Hwang, Steiner minimal trees on the Chinese checkerboard, Math. Mag., to appear.

  36. F.K. Hwang and D.S. Richards, Steiner tree problem, Networks, to appear.

  37. F.K. Hwang, G.D. Song, G.Y. Ting and D.Z. Du, A decomposition theorem on Euclidean Steiner minimal trees, Discr. Comput. Geom. 3(1988)367–382.

    Google Scholar 

  38. F.K. Hwang and J.F. Weng, Hexagonal coordinate systems and Steiner minimal trees, Discr. Math. 62(1986)498–557.

    Google Scholar 

  39. F.K. Hwang and J.F. Weng, The shortest network with a given topology, Preprint (1988).

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

    Google Scholar 

  41. V. Jarnik and O. Kössler, O minimálnich grafesh obsahujicich n daných bodu, Ĉasopis Pêst. Mat. Fys. 63(1934)223–235.

    Google Scholar 

  42. R.M. Karp, Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane, Math. Oper. Res. 2(1977)209–224.

    Google Scholar 

  43. M. Lundy, Applications of the annealing algorithm to combinatorial problems in statistics, Biometrika 72(1985)191–198.

    Google Scholar 

  44. Z.A. Melzak, On the problem of Steiner, Can. Math. Bull. 4(1961)143–148.

    Google Scholar 

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

    Google Scholar 

  46. J.S. Provan, Convexity and the Steiner tree problem, Networks 18(1988)55–72.

    Google Scholar 

  47. J.S. Provan, The role of Steiner hulls in the solution to Steiner tree problems, Ann. Oper. Res., this volume.

  48. J.H. Rubinstein and D.A. Thomas, A variational approach to the Steiner network problem, Ann. Oper. Res., this volume.

  49. J.H. Rubinstein and D.A. Thomas, A variational approach to the Steiner ratio conjecture for six points, Preprint (1989).

  50. J.H. Rubinstein and D.A. Thomas, The Steiner ratio conjecture for cocircular points, Preprint (1989).

  51. J.H. Rubinstein and D.A. Thomas, Graham's problem on shortest networks for points on a circle, Algorithmica, to appear.

  52. M.I. Shamos and D. Hoey, Closest-point problems,16th Ann. Symp. on Foundations of Computer Science (1975), pp. 151–162.

  53. J.M. Smith, D.T. Lee and J.S. Liebman, AnO(N logN) heuristic for Steiner minimal tree problems on the Euclidean metric, Networks 11(1981)23–29.

    Google Scholar 

  54. W.D. Smith, Studies in discrete and computational geometry, Ph.D. Thesis, Program in Applied and Pure Mathematics, Princeton University (1988).

  55. W.D. Smith, How to find Steiner minimal trees in Euclideand-space, Algorithmica, to appear.

  56. W.D. Smith and P.W. Shor, Steiner tree problems, Algorithmica, to appear.

  57. J. Soukup, Minimum Steiner trees, roots of a polynomial and other magic, ACM/SIGMAP Newsletter 22(1977)37–51.

    Google Scholar 

  58. J. Soukup and W.F. Chow, Set of test problems of the minimum length connection networks, SIGMAP Newsletter 15(1973)48–51.

    Google Scholar 

  59. J.M. Steele, Subadditive Euclidean functionals and nonlinear growth in geometric probabilities, Ann. Prob. 9(1982)365–376.

    Google Scholar 

  60. E.A. Thompson, The method of minimum evolution, Ann. Human Genetics (London) 36(1973)333–340.

    Google Scholar 

  61. D. Trietsch and F.K. Hwang, An improved algorithm for Steiner trees, SIAM J. Appl. Math. 49(1989).

  62. V.G. Vainer, I.D. Zaitsev and Ê.M. Livshits, Design algorithms for connection networks, translated from Avtomatika i Telemekhanika 7(1978)153–162.

    Google Scholar 

  63. P. Winter, An algorithm for the Steiner problem in the Euclidean plane, Networks 15(1985)323–345.

    Google Scholar 

  64. W.C. Yu and S.B. Xu, The Steiner ratio conjecture on six points,Tienjing Conf. on Combinatorial Optimization, Tienjing, China (1988).

Download references

Author information

Authors and Affiliations

  1. AT & T Bell Laboratories, 07974, Murray Hill, NJ, USA

    F. K. Hwang

Authors
  1. F. K. Hwang
    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

Hwang, F.K. A primer of the Euclidean Steiner problem. Ann Oper Res 33, 73–84 (1991). https://doi.org/10.1007/BF02061658

Download citation

  • Issue Date:

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

Keywords

Search

Navigation