Browse > Article

Efficient Construction of Large Scale Steiner Tree using Polynomial-Time Approximation Scheme  

Kim, In-Bum (School of Information Technology, Kimpo College)
Publication Information
Journal of the Institute of Electronics Engineers of Korea CI / v.47, no.5, 2010 , pp. 25-34 More about this Journal
Abstract
By introducing additional nodes called Steiner points, the problem of Steiner Minimum Tree whose length can be shorter than Minimum Spanning Tree and which connects all input terminal nodes belongs to Non-Polynomial Complete domain. Though diverse heuristic methods can be applied to the problem, most of them may meet serious pains in computing and waiting for a solution of the problem with numerous input nodes. For numerous input nodes, an efficient PTAS approximation method producing candidate unit steiner trees with portals in most bottom layer, merging them hierarchically to construct their parent steiner trees in upper layer and building swiftly final approximation Steiner tree in most top layer is suggested in this paper. The experiment with 16,000 input nodes and designed 16 unit areas in most bottom layer shows 85.4% execution time improvement in serial processing and 98.9% in parallel processing comparing with pure Steiner heuristic method, though 0.24% overhead of tree length. Therefore, the suggested PTAS Steiner tree method can have a wide range applications to build a large scale approximation Steiner tree quickly.
Keywords
PTAS; Minimum Spanning Tree; Steiner Minimum Tree; Unit Area; Portal;
Citations & Related Records
Times Cited By KSCI : 4  (Citation Analysis)
연도 인용수 순위
1 X. Cheng, J.M. Kim and B. Lu, "A Polynomial Time Approximation Scheme for the Problem of Interconnecting Highways," Journal of Combinatorial Optimization, Vol. 5, issue 3, pp.327-343, 2001.   DOI   ScienceOn
2 B. Bell, "Steiner Minimal Tree Problem," http://www.css.taylor.edu/~bbell/steiner/, 1999.
3 T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithm, 2nd ed., MITPress, pp.525-579, 2001.
4 김준모, "센서 네트워크 구축에서의 Combinatorial 기법 적용", 대한 전자공학회 논문지 TC, Vol.45, No.7, pp.9-16, 2008.   과학기술학회마을
5 C. Liu, S. Yuan, S. Kuo, S. Wang, "High-performance Obstacle-avoiding Rectilinear Steiner Tree Construction," ACM Transactions on Design Automation of Electronic Systems, Article 45, Vol.14, No.3, 2009.
6 Y. Wang, X. Hong, T. Jing, Y. Yang, X. Hu, G. Yan, "The Polygonal Contraction Heuristic for Rectilinear Steiner Tree Construction," Proceedings of the 2005 Asia and South Pacific Design Automation Conference, Shanghai, China, pp.1-6, 2005.
7 A. Hayrapetyan, C. Swamy and E. Tardos, "Network Design for Information Networks," Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.933-942, 2005.
8 김재각, 김인범, 김수인, "원격 검침 시스템에서 근사 최소 스타이너 트리를 이용한 집중기 및 중계기의 효율적인 배치와 연결", 한국통신학회 논문지B, Vol.34 No.10, pp.994-1003, 2009.   과학기술학회마을
9 이성근, 한치근, "다중 제약이 있는 멀티캐스트 트리 문제에 관한 연구", 한국 인터넷정보학회 논문지, Vol.5, No.5, pp.129-138, 2004.   과학기술학회마을
10 양성덕, 유용규, 이상중, "Steiner Tree 이론을 이용한 우편물 교환센터의 최적 위치 선정", 한국 조명 전기설비학회 논문지. Vol.22, No.9 pp.82-87, 2008.   과학기술학회마을
11 http://en.wikipedia.org/wiki/Steiner_tree, 2010.
12 S. Arora, "Polynomial-time Approximation Schemes for Euclidean TSP and Other Geometric Problems," Journal of ACM, Vol.45, issue 5, pp.753-782, 1998.   DOI   ScienceOn