The Steiner tree problem in lambda(4)-geometry plane

CSpace

	The Steiner tree problem in lambda(4)-geometry plane
	Lin, GH ; Xue, GL
	1998
发表期刊	ALGORITHMS AND COMPUTATIONS
ISSN	0302-9743
卷号	1533 页码:327-336
摘要	In this paper, we study the Steiner tree problem in the lambda (4)-geometry plane in which any line, half line or line segment must go in an orientation of i pi /4 with the positive x-axis, 0 less than or equal to i less than or equal to 7, and the distance between two points is the length of the shortest polygonal path connecting them. We show that for any set of n terminal points, there exists a Steiner minimal tree interconnecting these terminal points such that all Steiner points are in G([2n/3]-1) the ([2n/3]-1)(st)-generation grid points formed by the n terminal points. Our result improves previous known result which guarantees that for any set of n terminal points, there is a Steiner minimal tree in which all Steiner points are in G(n-2).
语种	英语
WOS研究方向	Computer Science ; Mathematics
WOS类目	Computer Science, Software Engineering ; Computer Science, Theory & Methods ; Mathematics, Applied
WOS记录号	WOS:000165171800035
出版者	SPRINGER-VERLAG BERLIN
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/13824
专题	中国科学院数学与系统科学研究院
通讯作者	Lin, GH
作者单位	1.Univ Vermont, Dept Comp Sci, Burlington, VT 05405 USA 2.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Lin, GH,Xue, GL. The Steiner tree problem in lambda(4)-geometry plane[J]. ALGORITHMS AND COMPUTATIONS,1998,1533:327-336.
APA	Lin, GH,&Xue, GL.(1998).The Steiner tree problem in lambda(4)-geometry plane.ALGORITHMS AND COMPUTATIONS,1533,327-336.
MLA	Lin, GH,et al."The Steiner tree problem in lambda(4)-geometry plane".ALGORITHMS AND COMPUTATIONS 1533(1998):327-336.