Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2010.17A.5.213

Mechanism for Connecting Input Edges Using Steiner Tree  

Kim, Joon-Mo (단국대학교 컴퓨터학부)
Kim, In-Bum (김포대학 IT학부)
Publication Information
The KIPS Transactions:PartA / v.17A, no.5, 2010 , pp. 213-220 More about this Journal
Abstract
In this paper, a mechanism connecting all input edges with minimum length through Steiner tree is proposed. Edges are convertible into communication lines, roads, railroads or trace of moving object. Proposed mechanism could be applied to connect these edges with minimum cost. In our experiments where input edge number and maximum connections per edge are used as input parameters, our mechanism made connection length decrease average 6.8%, while building time for a connecting solution increase average 192.0% comparing with the method using minimum spanning tree. The result shows our mechanism might be well applied to the applications where connecting cost is more important than building time for a connecting solution.
Keywords
Steiner Minimum Steiner Tree; Edge Minimum Spanning Tree; Input Edge; Connecting Line;
Citations & Related Records
Times Cited By KSCI : 6  (Citation Analysis)
연도 인용수 순위
1 T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithm, 2ndEd., MITPress, 2001.
2 김인범, 김수인, “선분상의 포탈을 이용한 근사 선분 최소 신장 트리의 생성”, 정보처리학회논문지, 12월, 2009.   DOI
3 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.
4 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
5 김재각, 김인범, 김수인, 원격 검침 시스템에서 근사 최소 스타이너 트리를 이용한 집중기 및 중계기의 효율적인 배치와 연결, 한국통신학회논문지: 네트워크 및 서비스, Vol.34 No.10, pp.994-1003, 2009.
6 서민석, 김대철, “스타이너 트리 문제를 위한 Mar-Min Ant Colony Optimization”, 경영과학, Vol.26, No.1, pp.65-76, 2009
7 이승관, “멀티캐스트 라우팅 문제 해결을 위한 엘리트 개미 시스템”, 한국컴퓨터정보학회논문지, Vol.13, No.3, pp.147-152, 2008.
8 이성근, 한치근, “다중 제약이 있는 멀티캐스트 트리 문제에 관한 연구”, 한국인터넷정보학회논문지, Vol.5, No.5, pp.129-138, 2004.
9 김준모, “센서 네트워크 구축에서의 Combinatorial 기법 적용”, 대한전자공학회논문지TC, Vol.45, No.7, pp.9-16, 2008.
10 B. Bell, “Steiner Minimal Tree Problem”, http://www.css.taylor.edu/-bbell/steiner/, January, 1999.
11 http://en.wikipedia.org/wiki/Minimum_spanning_tree, December, 2009.
12 F.K. Hwang, D.S. Richards and P. Winter, “The Steiner Tree Problem,” Annals of Discrete Mathematics, Vol.53, North-Holland, 1992.
13 W. Shi and C. Su, “The Rectilinear Steiner Arborescence Problem is NP-Complete,” Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp.780-787, 2000.
14 http://en.wikipedia.org/wiki/Steiner_tree, December, 2009.
15 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