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

Efficient Construction of Large Scale Grade of Services Steiner Tree Using Space Locality and Polynomial-Time Approximation Scheme  

Kim, In-Bum (Dept. of Internet Information, Kimpo College)
Publication Information
Journal of the Korea Society of Computer and Information / v.16, no.11, 2011 , pp. 153-161 More about this Journal
Abstract
As the problem of GOSST building belongs to NP compete domain, heuristics for the problem ask for immense amount execution time and computations in large scale inputs. In this paper, we propose an efficient mechanism for GOSST construction using space locality PTAS. For 40,000 input nodes with maximum weight 100, the proposed space locality PTAS GOSST with 16 unit areas can reduce about 4.00% of connection cost and 89.26% of execution time less than weighted minimum spanning tree method. Though the proposed method increases 0.03% of connection cost more, but cuts down 96.39% of execution time less than approximate GOSST method (SGOSST) without PTAS. Therefore the proposed space locality PTAS GOSST mechanism can work moderately well to many useful applications where a greate number of weighted inputs should be connected in short time with approximate minimum connection cost.
Keywords
PTAS(Polynomial-Time Approximation Scheme); Minimum Spanning Tree; GOSST(Grade of Services Steiner Minimum Tree); Weight; Portal;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 N. Yang and Y. Hu, "Steiner Tree Heuristic Algo rithm Based on Weight," The 2010 International Conference on Future Computer and Communication (ICFCC 2010), Vol.3, pp.415-418, Wuhan, China, May 2010
2 I. Kim, "A Study on SGOSST Mechanism for Quality of Service in Network," Journal of the Korea Society of Computer and Information, Vol.16, No.9, Sep. 2011
3 M. Jun, S. Zhanjiang, W. Chunli, Y. Lingyun and W. Yake, "Study on Location-Selection of Logistics Distribution Center Based on GIS and Weighted Steiner Tree," 2009 International Forum on Computer Science-Technology and Applications (IFCSTA 2009), Vol.3, pp.326-329, Chongqing, China, Dec. 2009
4 C. Yang and G. Li, "A PTAS for Embedding a Directed Hypergraph in a Tree of Rings," 2010 IEEE International Conference on Computer Design and Applications (ICCDA 2010), Vol.1, pp.25-27, Qinhuangdao, China, June 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, Vol.45 No. 3, pp.451-458, Nov. 2009   DOI   ScienceOn
6 T. Erlebach and E. Leeuwen, "PTAS for Weighted Set Cover on Unit Squares," 13th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010) & 14th Intl. Workshop on Randomization and Computation (RANDOM 2010), pp.166-177, Barcelona, Spain, September, 2010
7 Z. Cao and X. Yang, "A PTAS for Parallel Batch Scheduling with Rejection and Dynamic Job Arrivals," Theoretical Computer Science, Vol. 410 No.27-29, pp.2732-2745, June, 2009   DOI   ScienceOn
8 J. Kim and B, Hwang, "An Adaptive Approximation Method for the Interconnecting Highways Problem in Geographic Information Systems", Journal of Korea Spatial Information System Society, Vol.7, No.2, pp.57-66, Sep. 2005
9 http://en.wikipedia.org/wiki/Steiner_tree_problem, July 2011
10 T.H. Cormen, C.E Leiserson, R.L. Rivest and C. Stein, "Introduction to Algorithms," 2nd Ed., THe MIT Press, pp.561-579, 2001
11 G. Xue, G. Lin. and D.Z. Du, "Grade of Service Steiner Minimum Trees in Euclidean Plane," Algorithmica, Vol.31, pp.479-500, 2001   DOI   ScienceOn
12 J. Kim, M. Cardei, I. Cardei and X. Jia, "A Polyno mial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem," Algorithmica, Vol.42, pp.109-120, 2005.   DOI   ScienceOn
13 http://en.wikipedia.org/wiki/Polynomial-time_approxim ation_scheme, July 2011