Cart (Loading....) | Create Account
Close category search window
 

The longest side elimination solution for solving Steiner minimum tree problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Li-Li Xu ; Henan Univ. of Sci. & Technol., Luoyang, China ; Zong-Xiao Yang ; You-Lin Shang ; Ting-Ting Wang

The Steiner minimum tree (SMT) problem is one of the classic nonlinear combinatorial optimization problems for centuries. A novel solution, longest side elimination solution method (LSEM), is proposed in this paper. Firstly, the minimum spanning trees is defined as convex road and external side. Secondly, LSESM is constructed for solving the full SMT by using Melzak geometric composition principle to choose several points convex road which can satisfied certain conditions in the minimum spanning tree. And lastly, we can construct point set's full SMT according to visualization experiment results and Melzak geometric composition principle, combining with LSEM. A subsection-inserting points algorithm (SIPA) is described for eliminating the longest side in the convex road and solving the system shortest path sequentially. The global shortest path can be obtained by SIPA successfully compared with experimental results of visualization instrument.

Published in:

Advanced Mechatronic Systems (ICAMechS), 2011 International Conference on

Date of Conference:

11-13 Aug. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.