Design of the Steiner Minimal Tree

Article Preview

Abstract:

Steiner minimal tree is one of the most important combinatorial optimization problems, it has extensive application prospects. In this paper, we will present an algorithm for the Steiner minimal tree under the condition that the known points are less than 5 based on some elementary properties and the results on Steiner ratio. Moreover, we obtain some design figures with certain points distributed in the apexes of some equilateral triangles.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1032-1035

Citation:

Online since:

June 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] D. Zhang and S. Wang, Contemporary Mathematical History [M], Dalian: Dalian University of Technology Press,2010,211-216

Google Scholar

[2] America]R. Courant and H. Robbins, WHAT IS MATHEMATICS? [M], Oxford University Press, New York,(1964)

Google Scholar