Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2009.16A.6.509

Mechanism for Building Approximation Edge Minimum Spanning Tree Using Portals on Input Edges  

Kim, In-Bum (김포대학 IT학부)
Kim, Soo-In (김포대학 IT학부)
Publication Information
The KIPS Transactions:PartA / v.16A, no.6, 2009 , pp. 509-518 More about this Journal
Abstract
In this paper, a mechanism that produces an approximation edges minimum spanning tree swiftly using virtual nodes called portals dividing given edges into same distance sub-edges. The approximation edges minimum spanning tree can be used in many useful areas as connecting communication lines, road networks and railroad systems. For 3000 random input edges, when portal distance is 0.3, tree building time decreased 29.74% while the length of the produced tree increased 1.8% comparing with optimal edge minimum spanning tree in our experiment. When portal distance is 0.75, tree building time decreased 39.96% while the tree length increased 2.96%. The result shows this mechanism might be well applied to the applications that may allow a little length overhead, but should produce an edge connecting tree in short time. And the proposed mechanism can produce an approximation edge minimum spanning tree focusing on tree length or on building time to meet user requests by adjusting portal distance or portal discard ratio as parameter.
Keywords
Approximation Edge Minimum Spanning Tree; Portal; Portal Distance; Portal Discard Rate; Input Edge; Connecting Edge;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. Ahuja and Y. Zhu, “A distributed algorithm for minimum weight spanning trees based on echo algorithms”, 9th International Conference on Distributed Computing Systems, pp.2-8, June, 1989
2 J.M. Ho, D.T. Lee, C.H. Chang, and C.K. Wong, “Minimum Diameter Spanning Trees and Related Problems”, SIAM Journal on Computing Vol.20, No.5, pp.987-997, 1991   DOI
3 R.L.Grahan and P. Hell, “On the History of the Minimum Spanning Tree Problem”, Annals of the History of Computing, Vol.7, No.1, pp.43-57   DOI   ScienceOn
4 http://en.wikipedia.org/wiki/Minimum_spanning_tree, August, 2009.
5 T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithm, 2nd Ed., MIT Press, 2001
6 F.P. Preparata and M.I. Shamos, Computational Geometry: an Introduction, Springer-Verlag, New York, 1985
7 K.W. Chong, Y. Han, and T.W. Lam, “Concurrent threads and optimal parallel minimum spanning trees algorithm”, Journal of the ACM, Vol.48, pp.297-323, March, 2001   DOI   ScienceOn
8 J. Gudmundsson, H. Haverkort, S.M. Park, C.S. Shin and A. Wolff, “Approximating the Geometric Minimum-Diameter Spanning Tree”, APPROX 2002, Springer LNCS 2462, pp.146-160, 2002
9 S. Pettie and V. Ramachandran, “An Optimal Minimum Spanning Tree Algorithm”, Journal of the ACM, Vol.49, pp.16-34, January, 2002   DOI   ScienceOn
10 D.R. Karger, P.N. Klein and R.E. Tarjan, “A randomized linear-time algorithm to find minimum spanning trees”, Journal of the ACM, Vol.42, pp.321-328, March, 1995   DOI   ScienceOn
11 C. Monmna and S. Suri, “Transitions in Geometric Spanning Trees”, Transitions in Geometric Spanning Trees Vol.8, No.1, pp.265-293, Dec 1992
12 K.M. Chandy and T. Lo, “The Capacitated minimum spanning tree”, Networks Vol.3, pp.173-182, 1973   DOI   ScienceOn
13 B. Bell, “Steiner Minimal Tree Problem”, http://www.css.taylor.edu/-bbell/steiner/, January, 1999
14 J. Kim, M. Cardei, I. Cardei and X. Jia, “A Polynomial Time Approximation Scheme for the Grade of Services Steiner Minimum Tree Problem”, Journal of Global Optimization Vol.24, pp.437-448, 2002   DOI   ScienceOn