By Topic

Approximating hexagonal Steiner minimal trees by fast optimal layout of minimum spanning trees

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
$33 $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

3 Author(s)
Guo-Hui Lin ; Dept. of Comput. Sci., Vermont Univ., Burlington, VT, USA ; Guoliang Xue ; Defang Zhou

We study algorithms for approximating a Steiner minimal tree interconnecting n points under hexagonal routing. We prove that: (1) every minimum spanning tree is separable; (2) a minimum spanning tree with maximum node degree no more than 5 can be computed in O (n log n) time; (3) an optimal L-shaped layout of a given minimum spanning tree can be computed in O(n) time; (4) an optimal stair-shaped layout of a given minimum spanning tree can be computed in O(n2) time. Computational results on standard benchmarks show that our algorithm compares favorably to the current best algorithms

Published in:

Computer Design, 1999. (ICCD '99) International Conference on

Date of Conference: