An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane

被引：28

作者：

Wang, LS ^{[1
]}

Li, ZM ^{[1
]}

机构：

[1] City Univ Hong Kong, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China

来源：

INFORMATION PROCESSING LETTERS | 2002年 / 81卷 / 03期

关键词：

algorithmical approximations; algorithms; Steiner trees;

D O I：

10.1016/S0020-0190(01)00209-5

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We study a bottleneck Steiner tree problem: given a set P = {p(1,) p(2), - - -, p(n) } of n terminals in the Euclidean plane and a positive integer k, find a Steiner tree with at most k Steiner points such that the length of the longest edges in the tree is minimized. The problem has applications in the design of wireless communication networks. We give a ratio-1.866 approximation algorithm for the problem. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

页码：151 / 156

页数：6

共 50 条

[21] The Euclidean bottleneck Steiner tree and Steiner tree with minimum number of Steiner points
Du, DZ
Wang, LS
Xu, BA
[J]. COMPUTING AND COMBINATORICS, 2001, 2108 : 509 - 518
[22] Nearly optimal solution for restricted euclidean bottleneck Steiner tree problem
Li, Zimao
Xiao, Wenying
[J]. Journal of Networks, 2014, 9 (04) : 1000 - 1004
[23] The Euclidean Bottleneck Steiner Path Problem
Abu-Affash, A. Karim
Carmi, Paz
Katzi, Matthew J.
Segal, Michael
[J]. COMPUTATIONAL GEOMETRY (SCG 11), 2011, : 440 - 447
[24] Approximations for two variants of the Steiner tree problem in the Euclidean plane
Li, Jianping
Wang, Haiyan
Huang, Binchao
Lichen, Junran
[J]. JOURNAL OF GLOBAL OPTIMIZATION, 2013, 57 (03) : 783 - 801
[25] An Efficient Approximation Algorithm for the Steiner Tree Problem
Chen, Chi-Yeh
Hsieh, Sun-Yuan
[J]. COMPLEXITY AND APPROXIMATION: IN MEMORY OF KER-I KO, 2020, 12000 : 238 - 251
[26] An Efficient Approximation Algorithm for the Steiner Tree Problem
Chen, Chi-Yeh
[J]. PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND SYSTEMS (ICISS 2019), 2019, : 179 - 184
[27] Generalised k-Steiner Tree Problems in Normed Planes
Brazil, Marcus
Ras, Charl J.
Swanepoel, Konrad J.
Thomas, Doreen A.
[J]. ALGORITHMICA, 2015, 71 (01) : 66 - 86
[28] A parallel local search algorithm for Euclidean Steiner tree problem
Bin Muhammad, Rashid
[J]. SNPD 2006: Seventh ACIS International Conference on Software Engineering Artificial Intelligence, Networking, and Parallel/Distributed Computing, Proceedings, 2006, : 157 - 162
[29] Approximations for a Bottleneck Steiner Tree Problem
[J]. Algorithmica, 2002, 32 : 554 - 561
[30] A Flow-Dependent Quadratic Steiner Tree Problem in the Euclidean Plane
Brazil, Marcus N.
Ras, Charl J.
Thomas, Doreen A.
[J]. NETWORKS, 2014, 64 (01) : 18 - 28

← 1 2 3 4 5 →