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


Vol. 32,  No. 9, pp. 569-576, Sep.  2007


PDF Full-Text
  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 known 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.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

I. Kim and C. Kim, "A Study on the G-Node and Disconnected Edges to Improve the Global and Local Locating Heuristic for GOSST Problem," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 9, pp. 569-576, 2007. DOI: .

[ACM Style]

Inbum Kim and Chae-kak Kim. 2007. A Study on the G-Node and Disconnected Edges to Improve the Global and Local Locating Heuristic for GOSST Problem. The Journal of Korean Institute of Communications and Information Sciences, 32, 9, (2007), 569-576. DOI: .

[KICS Style]

Inbum Kim and Chae-kak Kim, "A Study on the G-Node and Disconnected Edges to Improve the Global and Local Locating Heuristic for GOSST Problem," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 9, pp. 569-576, 9. 2007.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880