On shortest three-edge-connected Steiner networks with Euclidean distance

CSpace > 应用数学研究所

	On shortest three-edge-connected Steiner networks with Euclidean distance
	Hsu, DF ; Hu, XD
	2000-07-15
发表期刊	DISCRETE APPLIED MATHEMATICS
ISSN	0166-218X
卷号	103 期号:1-3 页码:141-152
摘要	Given a set of points P on the Euclidean plane, we consider the problem of constructing a shortest three-edge-connected Steiner network of P. Let l(3)(P) denote the length of the shortest three-edge-connected Steiner network of P divided by the length of the shortest three-edge-connected spanning network of P, and let inf{l(3)(P)\ P} be the infimum of this value over all point sets P in the plane. We show that for any P, root 3/2 less than or equal to inf{l(3)(P)\ P} less than or equal to (3 + root 3)/5, and there is a polynomial-time (5/root 3)-approximation algorithm for the problem. Moreover for those P whose points lie on the sides of its convex hull, l(3)(P) > (2 + root 3)/4, and there exists a fully polynomial-time approximation scheme for the problem in this special case. (C) 2000 Elsevier Science B.V. All rights reserved.
关键词	Steiner networks spanning networks edge-connectivity approximation algorithms
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied
WOS记录号	WOS:000087473600009
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/15350
专题	应用数学研究所
通讯作者	Hu, XD
作者单位	1.Japan Adv Inst Sci & Technol, Grad Sch Informat Sci, Tatsunokuchi, Ishikawa 92312, Japan 2.Fordham Univ, Dept Comp & Informat Sci, New York, NY 10023 USA 3.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Hsu, DF,Hu, XD. On shortest three-edge-connected Steiner networks with Euclidean distance[J]. DISCRETE APPLIED MATHEMATICS,2000,103(1-3):141-152.
APA	Hsu, DF,&Hu, XD.(2000).On shortest three-edge-connected Steiner networks with Euclidean distance.DISCRETE APPLIED MATHEMATICS,103(1-3),141-152.
MLA	Hsu, DF,et al."On shortest three-edge-connected Steiner networks with Euclidean distance".DISCRETE APPLIED MATHEMATICS 103.1-3(2000):141-152.