On shortest three-edge-connected Steiner networks with Euclidean distance
文献类型：期刊论文
| 作者 | Hsu, DF; Hu, XD
|
| 刊名 | DISCRETE APPLIED MATHEMATICS
 |
| 出版日期 | 2000-07-15 |
| 卷号 | 103期号:1-3页码:141-152 |
| 关键词 | Steiner networks spanning networks edge-connectivity approximation algorithms |
| ISSN号 | 0166-218X |
| 英文摘要 | 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. |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000087473600009 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/15349]  |
| 专题 | 应用数学研究所 |
| 通讯作者 | 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. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。