CSpace  > 系统科学研究所
Yang Xiaoguang
Source Publicationjournalofsystemsscienceandcomplexity
AbstractIn this paper, we consider a network communication delay improvement prob-lem, which is to upgrade nodes in a network with minimum cost such that the communication delay between any two nodes of the network is below a pre-specific level. In the upgrading model, the improvement by upgrading one node is a continuous variable, and the cost incurred by such an upgrading is a linear function of the improvement. We show that achieving an approximation ratio β In(|V|) for the problem is NP-hard for some constant β>0 even if the underlying network is a bipartite graph. But if the underlying network is restricted as a tree, we show that it can be solved in a strongly polynomial time.
Document Type期刊论文
Recommended Citation
GB/T 7714
Yang Xiaoguang. toimprovethecommunicationdelaybyupgradingnodesinacontinuousversion[J]. journalofsystemsscienceandcomplexity,2005,018(001):67.
APA Yang Xiaoguang.(2005).toimprovethecommunicationdelaybyupgradingnodesinacontinuousversion.journalofsystemsscienceandcomplexity,018(001),67.
MLA Yang Xiaoguang."toimprovethecommunicationdelaybyupgradingnodesinacontinuousversion".journalofsystemsscienceandcomplexity 018.001(2005):67.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Yang Xiaoguang]'s Articles
Baidu academic
Similar articles in Baidu academic
[Yang Xiaoguang]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Yang Xiaoguang]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.