Browse > Article

A Study on the G-Node and Disconnected Edges to Improve the Global and Local Locating Heuristic for GOSST Problem  

Kim, In-Bum (김포대학 컴퓨터계열)
Kim, Chae-Kak (김포대학 컴퓨터계열)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.32, no.9B, 2007 , pp. 569-576 More about this Journal
Abstract
This paper is on the enhancement of our heuristics for GOSST problem that could apply to the design of communication networks offering graduated services. This problem hewn as one of NP-Hard problems finds a network topology meeting the G-Condition with minimum construction cost. In our prior research, we proposed two heuristics. We suggest methods of selecting G-Node and disconnections for Global or Local locating heuristic in this research. The ameliorated Local locating heuristic retrenches 17% more network construction cost saving ratio and the reformed Global locating heuristic does 14% more than our primitives.
Keywords
GOSST problem; G-Node; G-Condition; Steiner point; Disconnection;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D.Z. Du and F.K. Hwang, 'An Approach for Providing Lower Bounds; Solution of Gilbert-Pollak Conjecture on Steiner Ratio', Proceedings of IEEE 31sy FOCS, pp.76-85, 1990
2 C. Duin and A. Volgenant, 'The Multi-weighted Steiner Tree Problem', Annals of Operations Research, Vol.33, pp.451-469, 1991   DOI
3 A. Balakrishnan, T.L. Nagnanti, P. Mirchandani, 'Modeling and Heuristic Worst Case Performance Analysis of the Two Level Network Design Problem', Management Science, Vol.40, pp.846-867, 1994   DOI   ScienceOn
4 E.J. Cockayne and D.E. Hewgrill, 'Exact Computation of Steiner Minimal Trees in the Plane', Information Processing Letters, Vol.22, pp.151-156, 1986   DOI   ScienceOn
5 E.J. Cockayne and D.E. Hewgrill, 'Improved Computation of Plane Steiner Minimal Tree', Algorithmica, Vol.7, pp.219-229, 1992   DOI
6 J. Kim and I. Kim, 'Approximation Ratio 2 for the Minimum Number of Steiner Points', Journal of KISS, pp.387-396, 2003
7 G.L. Xue, G.H. Lin and D.Z. Du, 'Grade of Service Steiner Minimum Trees in Euclidean Plane', Algorithmica, Vol.31, pp.479-500, 2001   DOI
8 J. Kim, M. Cardei, I. Cardei and X. Jia, 'A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem', Algorithmica, Vol.42, pp.109-120, 2005   DOI
9 S. Arora, 'Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems', Proceeding of 37th IEEE Symposium on Foundations of Computer Science, pp.2-12, 1996
10 F.K. Hwang, 'A Primer of the Euclidean Steiner problem', Annals of Operations Research, Vol.33, pp.73-84, 1991   DOI
11 M.J. Smith and B. Toppur, 'Euclidean Steiner Minimal Trees, Minimum Energy Configurations and the Embedding Problem of Weighted Graph in E3', Discrete Applied Mathematics, Vol.71, pp.187-215, 1997   DOI   ScienceOn
12 J.R. Current, C.S. Revelle and J.L. Cohon, 'The Hierarchical Network Design Problem ', European Journal of Operational Research, Vol.27, pp.57-66, 1986   DOI   ScienceOn
13 F.K. Hwang, D.S. Richards and P. Winter, 'The Steiner Tree Problem', Annals of Discrete Mathematics, Vol.53, North-Holland, 1992
14 I. Kim, C. Kim and S.H. Hosseini, 'A Heuristic Using GOSST with 2 Connecting Strategies for Minimum Construction Cost of Network', International Journal of Computer Science and Network Security, Vol.6, No.12, pp.60-72, 2006
15 P. Winter, 'An Algorithm for the Steiner Problem in the Euclidean Plane', Networks, Vol.15, pp.323-345, 1985   DOI   ScienceOn
16 G.H. Lin and G.L. Xue, 'Steiner Tree Problem with Minimum Number of Steiner Points & Bounded Edge-length', Information Processing Letters, pp.53-57, 1999