Approximations for Steiner trees with minimum number of Steiner points

	Approximations for Steiner trees with minimum number of Steiner points
	Chen, DH ; Du, DZ ; Hu, XD ; Lin, GH ; Wang, LS ; Xue, GL
刊名	THEORETICAL COMPUTER SCIENCE
	2001-07-06
卷号	262 期号:1-2 页码:83-99
关键词	Steiner trees approximation algorithms VLSI design WDM optical networks
ISSN号	0304-3975
英文摘要	Given 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.
WOS研究方向	Computer Science
语种	英语
出版者	ELSEVIER SCIENCE BV
WOS记录号	WOS:000169594100005
内容类型	期刊论文
源URL	[http://ir.amss.ac.cn/handle/2S8OKBNM/15274]
专题	中国科学院数学与系统科学研究院
通讯作者	Chen, DH
作者单位	1.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
推荐引用方式 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.