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 条
  • [1] Approximation algorithm for bottleneck Steiner tree problem in the Euclidean plane
    Li, ZM
    Zhu, DM
    Ma, SH
    [J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2004, 19 (06) : 791 - 794
  • [2] Approximation algorithm for bottleneck Steiner tree problem in the Euclidean plane
    Zi-Mao Li
    Da-Ming Zhu
    Shao-Han Ma
    [J]. Journal of Computer Science and Technology, 2004, 19 : 791 - 794
  • [3] An exact algorithm for the Euclidean k-Steiner tree problem
    Brazil, Marcus
    Hendriksen, Michael
    Lee, Jae
    Payne, Michael S.
    Ras, Charl
    Thomas, Doreen
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2024, 121
  • [4] An approximation algorithm to the k-Steiner Forest problem
    Zhang, Peng
    Xia, Mingji
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (11) : 1093 - 1098
  • [5] An approximation algorithm to the k-steiner forest problem
    Zhang, Peng
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007, 4484 : 728 - 737
  • [6] An optimal algorithm for the Euclidean bottleneck full Steiner tree problem
    Biniaz, Ahmad
    Maheshwari, Anil
    Smid, Michiel
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2014, 47 (03): : 377 - 380
  • [7] On the restricted k-Steiner tree problem
    Bose, Prosenjit
    D'Angelo, Anthony
    Durocher, Stephane
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (04) : 2893 - 2918
  • [8] On the restricted k-Steiner tree problem
    Prosenjit Bose
    Anthony D’Angelo
    Stephane Durocher
    [J]. Journal of Combinatorial Optimization, 2022, 44 : 2893 - 2918
  • [9] The Euclidean Bottleneck Full Steiner Tree Problem
    Abu-Affash, A. Karim
    [J]. ALGORITHMICA, 2015, 71 (01) : 139 - 151
  • [10] The Euclidean Bottleneck Full Steiner Tree Problem
    A. Karim Abu-Affash
    [J]. Algorithmica, 2015, 71 : 139 - 151
12345