Browse > Article
http://dx.doi.org/10.9708/jksci.2014.19.1.057

Efficient Construction of Euclidean Steiner Minimum Tree Using Combination of Delaunay Triangulation and Minimum Spanning Tree  

Kim, Inbum (Dept. of Internet Information, Kimpo College)
Publication Information
Journal of the Korea Society of Computer and Information / v.19, no.1, 2014 , pp. 57-64 More about this Journal
Abstract
As Steiner minimum tree building belongs to NP-Complete problem domain, heuristics for the problem ask for immense amount execution time and computations in numerous inputs. In this paper, we propose an efficient mechanism of euclidean Steiner minimum tree construction for numerous inputs using combination of Delaunay triangulation and Prim's minimum spanning tree algorithm. Trees built by proposed mechanism are compared respectively with the Prim's minimum spanning tree and minimums spanning tree based Steiner minimum tree. For 30,000 input nodes, Steiner minimum tree by proposed mechanism shows about 2.1% tree length less and 138.2% execution time more than minimum spanning tree, and does about 0.013% tree length less and 18.9% execution time less than minimum spanning tree based Steiner minimum tree in experimental results. Therefore the proposed mechanism can work moderately well to many useful applications where execution time is not critical but reduction of tree length is a key factor.
Keywords
Delaunay Triangulation; Euclidean Steiner Minimum Tree; Minimum Spanning Tree; Tree Length;
Citations & Related Records
Times Cited By KSCI : 5  (Citation Analysis)
연도 인용수 순위
1 T.H. Cormen, C.E Leiserson, R.L. Rivest and C. Stein, "Introduction to Algorithms," 2nd Ed., THe MIT Press, pp.561-579, 2001.
2 http://en.wikipedia.org/wiki/Steiner_tree_problem, October, 2013.
3 F.K. Hwang, D.S. Richards and P. Winter, "The Steiner Tree Problem," Annals of Discrete Mathematics, Vol. 53, North-Holland, 1992.
4 http://en.wikipedia.org/wiki/Delaunay_triangulation, October, 2013.
5 B. Bell, "Steiner Minimal Tree Problem", http://www.css.taylor.edu/-bbell/steiner/, January 1999.
6 J. Kim, M. Cardei, I. Cardei and X. Jia, "A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem," Algorithmica, Vol.42, pp.109-120, 2005.   DOI   ScienceOn
7 M. Seo, D. Kim, "A Max-Min Ant Colony Optimization for Undirected Steiner Tree Problem in Graphs", Korean Management Science Review, Vol.26, No.1, pp.65-76, 2009.
8 S. Lee, "Elite Ant System for Solving Multicast Routing Problem," Journal of the Korea Society of Computer and Information, Vol.13, No.3, pp.147-152, 2008.
9 J. Kim, "The application of the combinatorial schemes for the layout design of Sensor Networks," Journal of the Institute of Electronics Engineers of Korea TC, Vol.45, No.7, pp.9-16, 2008.
10 G. Leach, "ImprovingWorst-Case Optimal Delaunay Triangulation Algorithms," 4th Canadian Conference on Computational Geometry, June 1992.
11 Y. Sung, G. Kim, "Delaunay Triangulation based Fingerprint Matching Algorithm using Quality Estimation and Minutiae Classification," Journal of Korea Multimedia Society, Vol.13, No.4, pp. 547-559, 2010.
12 I. Kim, "Fast Construction of Three Dimensional Steiner Minimum Tree Using PTAS," Journal of the Korea Society of Computer and Information, Vol. 17, No.7, pp.87-95, 2011.