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

Efficient Construction of Euclidean Minimum Spanning Tree Using Partial Polynomial-Time Approximation Scheme in Unequality Node Distribution  

Kim, In-Bum (Dept. of Internet Information, Kimpo College)
Kim, Soo-In (Dept. of Avionics, Kimpo College)
Publication Information
Journal of the Korea Society of Computer and Information / v.19, no.6, 2014 , pp. 71-80 More about this Journal
Abstract
Employing PTAS to building minimum spanning tree for a large number of equal distribution input terminal nodes can be a effective way in execution time. But applying PTAS to building minimum spanning tree for tremendous unequal distribution node may lead to performance degradation. In this paper, a partial PTAS reflecting the scheme into specific node dense area is presented. In the environment where 90% of 50,000 input terminal nodes stand close together in specific area, approximate minimum spanning tree by our proposed scheme can show about 88.49% execution time less and 0.86%tree length less than by existing PTAS, and about 87.57%execution time less and 1.18% tree length more than by Prim's naive scheme. Therefore our scheme can go well to many useful applications where a multitude of nodes gathered around specific area should be connected efficiently as soon as possible.
Keywords
Polynomial-Time Approximation Scheme; Minimum Spanning Tree; Prim's Algorithm; Unequality Node Distribution;
Citations & Related Records
Times Cited By KSCI : 2  (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 PTAS(Polynomial Time Approximation Scheme), http://en.wikipedia.org/wiki/Polynomial-time_a pproximation_scheme, May, 2014.
3 F.Grandoni and T.RothvoB, "Pricing on paths: a PTAS for the highway problem," SODA '11 Proceedings of the twenty-second annual symposium on Discrete Algorithms, pp. 675-684, 2011
4 T. Erlebach and E. Leeuwen, "PTAS for weighted set cover on unit squares," APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques, pp.166-177, 2010
5 Z.Zhang, X.Gao, W.Wu and D.Du, "A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks," Journal of Global Optimization archive, Vol.45 No.3, pp.451-458, November 2009
6 J. Kim, "Interconnection Problem among the Dense Areas of Nodes in Sensor Networks," Journal of the Institute of Electronics Engineers of Korea TC, Vol.48, No.2, pp.6-13, 2011   과학기술학회마을
7 I. Kim, "Efficient Construction of Large Scale Grade of Services Steiner Tree Using Space Locality and Polynomial-Time Approximation Scheme," Journal of the Korea Society of Computer and Information, Vol.16, No.11, pp.153-161, 2011   과학기술학회마을   DOI   ScienceOn
8 Z. Cao and X. Yang, "A PTAS for parallel batch scheduling with rejection and dynamic job arrivals", Journal of Theoretical Computer Science archive, Vol.410, No.27-29, pp. 2732-2745. June, 2009   DOI   ScienceOn