CSpace
Approximations for Steiner trees with minimum number of Steiner points
Chen, DH; Du, DZ; Hu, XD; Lin, GH; Wang, LS; Xue, GL
2001-07-06
Source PublicationTHEORETICAL COMPUTER SCIENCE
ISSN0304-3975
Volume262Issue:1-2Pages:83-99
AbstractGiven n terminals in the Euclidean plane and a positive constant, find a Steiner tree interconnecting all terminals with the minimum number of Steiner points such that the Euclidean length of each edge is no more than the given positive constant. This problem is NP-hard with applications in VLSI design, WDM optical networks and wireless communications. In this paper, we show that (a) the Steiner ratio is 1/4, that is, the minimum spanning tree yields a polynomial-time approximation with performance ratio exactly 4, (b) there exists a polynomial-time approximation with performance ratio 3, and (c) there exists a polynomial-time approximation scheme under certain conditions. (C) 2001 Published by Elsevier Science B.V.
KeywordSteiner trees approximation algorithms VLSI design WDM optical networks
Language英语
WOS Research AreaComputer Science
WOS SubjectComputer Science, Theory & Methods
WOS IDWOS:000169594100005
PublisherELSEVIER SCIENCE BV
Citation statistics
Cited Times:36[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/15275
Collection中国科学院数学与系统科学研究院
Affiliation1.Univ Minnesota, Dept Comp Sci & Engn, Minneapolis, MN 55455 USA
2.City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
3.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
4.Univ Vermont, Dept Comp Sci, Burlington, VT 05405 USA
Recommended Citation
GB/T 7714
Chen, DH,Du, DZ,Hu, XD,et al. Approximations for Steiner trees with minimum number of Steiner points[J]. THEORETICAL COMPUTER SCIENCE,2001,262(1-2):83-99.
APA Chen, DH,Du, DZ,Hu, XD,Lin, GH,Wang, LS,&Xue, GL.(2001).Approximations for Steiner trees with minimum number of Steiner points.THEORETICAL COMPUTER SCIENCE,262(1-2),83-99.
MLA Chen, DH,et al."Approximations for Steiner trees with minimum number of Steiner points".THEORETICAL COMPUTER SCIENCE 262.1-2(2001):83-99.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Chen, DH]'s Articles
[Du, DZ]'s Articles
[Hu, XD]'s Articles
Baidu academic
Similar articles in Baidu academic
[Chen, DH]'s Articles
[Du, DZ]'s Articles
[Hu, XD]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Chen, DH]'s Articles
[Du, DZ]'s Articles
[Hu, XD]'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.