Journal of Applied Mathematics

Geometry-Experiment Algorithm for Steiner Minimal Tree Problem

Zong-Xiao Yang, Xiao-Yao Jia, Jie-Yu Hao, and Yan-Ping Gao

Full-text: Open access


It is well known that the Steiner minimal tree problem is one of the classical nonlinear combinatorial optimization problems. A visualization experiment approach succeeds in generating Steiner points automatically and showing the system shortest path, named Steiner minimum tree, physically and intuitively. However, it is difficult to form stabilized system shortest path when the number of given points is increased and irregularly distributed. Two algorithms, geometry algorithm and geometry-experiment algorithm (GEA), are constructed to solve system shortest path using the property of Delaunay diagram and basic philosophy of Geo-Steiner algorithm and matching up with the visualization experiment approach (VEA) when the given points increase. The approximate optimizing results are received by GEA and VEA for two examples. The validity of GEA was proved by solving practical problems in engineering, experiment, and comparative analysis. And the global shortest path can be obtained by GEA successfully with several actual calculations.

Article information

J. Appl. Math., Volume 2013 (2013), Article ID 367107, 10 pages.

First available in Project Euclid: 14 March 2014

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier


Yang, Zong-Xiao; Jia, Xiao-Yao; Hao, Jie-Yu; Gao, Yan-Ping. Geometry-Experiment Algorithm for Steiner Minimal Tree Problem. J. Appl. Math. 2013 (2013), Article ID 367107, 10 pages. doi:10.1155/2013/367107.

Export citation


  • F. K. Hwang, D. S. Richards, and P. Winter, The Steiner Tree Problem, vol. 53 of Annals of Discrete Mathematics, North-Holland, Amsterdam, The Netherlands, 1992.
  • X. Y. Li, G. Calinescu, and P. J. Wan, “Distributed construction of a planar spanner and routing for ad hoc wireless networks,” in Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '02), vol. 3, pp. 1268–1277, June 2002.
  • D. Du and X. Hu, Steiner Tree Problems in Computer Communication Networks, World Scientific Publishing, Singapore, 2008.
  • I. H.-R. Jiang and Y. T. Yu, “Configurable rectilinear steiner tree construction for SoC and nano technologies,” in Proceedings of the 26th IEEE International Conference on Computer Design (ICCD '08), pp. 34–39, Lake Tahoe, Calif, USA, October 2008.
  • L. Y. Wu and J. H. He, “The local tearing property of textiles with Steiner tree structure,” Advanced Materials Research, vol. 332–334, pp. 1429–1432, 2011.
  • L. Y. Wu and J. H. He, “Study on the stability of steiner tree structure of explosion-proof textiles,” Mathematical and Computational Applications, vol. 15, no. 5, pp. 936–939, 2010.
  • L. Y. Wu and J. H. He, “Explosion-proof textile with hierarchical Steiner tree structure,” Thermal Science, vol. 16, no. 2, pp. 343–344, 2012.
  • D. M. Warme, P. Winter, and M. Zachariasen, “Exact algorithms for plane Steiner tree problems: a computational study,” Tech. Rep. DIKU-TR-98/11.1998-3, 1998.
  • S. K. Chang, “The generation of minimal trees with a Steiner topology,” Journal of the Association for Computing Machinery, vol. 19, pp. 699–711, 1972.
  • E. A. Thompson, “The method of minimum evolution,” Annals of Human Genetics, vol. 36, no. 3, pp. 333–340, 1973.
  • M. Fampa and N. Maculan, “Using a conic formulation for finding Steiner minimal trees,” Numerical Algorithms, vol. 35, no. 2-4, pp. 315–330, 2004.
  • M. Karpinski and A. Zelikovsky, “New approximation algorithms for the steiner tree problems,” Journal of Combinatorial Optimization, vol. 1, no. 1, pp. 47–65, 1997.
  • S. Cinel and C. F. Bazlamaçci, “A distributed heuristic algorithm for the rectilinear steiner minimal tree problem,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 27, no. 11, pp. 2083–2087, 2008.
  • L. Luc, V. Sacha, and Z. Nicolasdesign, “An ant algorithm for the steiner tree problem in graphs,” in Proceedings of the EvoWorkshops, EvoCOMNET, EvoFIN, EvoIASP, EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTRANSLOG, pp. 42–51, 2007.
  • T. Koch and A. Martin, “SteinLib Testdata Library,” 2002,
  • B. Toppur and J. M. Smith, “A Sausage heuristic for Steiner minimal trees in three-dimensional euclidean space,” Journal of Mathematical Modelling and Algorithms, vol. 4, no. 2, pp. 199–217, 2005.
  • Z. M. Fu and Z. P. Chen, “Beauty of bubble,” Science Development Monthly, vol. 29, no. 11, pp. 788–796, 1990 (Chinese).
  • Z. X. Yang, Y. P. Gao, C. Y. Cheng, Z. Q. Feng, and Z. J. Zhang, “Visualization approach for the Steiner minimal tree problem,” System Engineering Theory and Practice, vol. 28, no. 7, pp. 173–178, 2008.
  • J. H. He and Y. Liu, “Control of bubble size and bubble number in bubble electrospinning,” Computers & Mathematics with Applications, vol. 64, no. 5, pp. 1033–1035, 2012.
  • J. H. He, “Effect of temperature on surface tension of a bubble and hierarchical ruptured bubbles for nanofiber fabrication,” Thermal Science, vol. 16, no. 1, pp. 327–330, 2012.
  • Z. X. Yang, “Visualization device of system shortest path programming,” Chinese Patent, ZL2006201301488, October 2007.
  • E. N. Gilbert and H. O. Pollak, “Steiner minimal trees,” SIAM Journal on Applied Mathematics, vol. 16, pp. 323–345, 1968.
  • Y.-P. Gao, B.-B. Yang, Z.-X. Yang, and J.-Y. Hao, “Visualization experimental approaches for power grid planning,” Power System Technology, vol. 33, no. 2, pp. 51–55, 2009.
  • X. Y. Li, I. Stojmenovic, and Y. Wang, “Partial Delaunay triangulation and degree limited localized bluetooth scatternet formation,” IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 4, pp. 350–361, 2004.
  • Z. A. Melzak, “On the problem of Steiner,” Canadian Mathematical Bulletin, vol. 4, pp. 143–148, 1961.