A polylogarithmic approximation algorithm for the group Steiner tree problem

被引：160
|
作者：
Garg, N [1 ]
Konjevod, G
Ravi, R
机构：
[1] Indian Inst Technol, New Delhi 110016, India
[2] Carnegie Mellon Univ, Dept Math Sci, Pittsburgh, PA 15213 USA
[3] Carnegie Mellon Univ, GSIA, Pittsburgh, PA 15213 USA
来源：
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC | 2000年 / 37卷 / 01期
基金：
美国国家科学基金会;
关键词：
D O I：
10.1006/jagm.2000.1096
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Given a weighted graph with some subsets of verticcs called groups. the group Steiner tree problem is to find a minimum-weight subgraph which contains at least one vertex from each group. We give a randomized algorithm with a polylogarithmic approximation guarantee for the group Steiner tree problem. The previous best approximation guarantee was O(i(2)k(1/i)) in time O(n(i)k(2i)) (Charikar, Chekuri, Goel. and Guha). Our algorithm also improves existing approximation results fur network design problems with location-based constraints and for the symmetric generalized traveling salesman problem. (C) 2000 Academic Press.
引用
收藏
页码：66 / 84
页数：19
相关论文
共 50 条
  • [21] An approximation algorithm for the Steiner connectivity problem
    Borndoerfer, Ralf
    Karbstein, Marika
    NETWORKS, 2018, 72 (02) : 174 - 181
  • [22] Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points
    Liu, Suding
    OPTIMIZATION LETTERS, 2024, 18 (06) : 1421 - 1435
  • [23] Differential approximation results for the Steiner tree problem
    Demange, M
    Monnot, J
    Paschos, VT
    APPLIED MATHEMATICS LETTERS, 2003, 16 (05) : 733 - 739
  • [24] APPROXIMATION ALGORITHMS FOR THE TERMINAL STEINER TREE PROBLEM
    Chen, Yen Hung
    Lin, Ying Chin
    APPLIED AND COMPUTATIONAL MATHEMATICS, 2018, 17 (03) : 246 - 255
  • [25] On approximation algorithms for the terminal Steiner tree problem
    Drake, DE
    Hougardy, S
    INFORMATION PROCESSING LETTERS, 2004, 89 (01) : 15 - 18
  • [26] Approximation hardness of the Steiner tree problem on graphs
    Chlebík, M
    Chlebíkov, J
    ALGORITHM THEORY - SWAT 2002, 2002, 2368 : 170 - 179
  • [27] A faster algorithm for the Steiner tree problem
    Mölle, D
    Richter, S
    Rossmanith, P
    STACS 2006, PROCEEDINGS, 2006, 3884 : 561 - 570
  • [28] A 5-approximation algorithm for the k-prize-collecting Steiner tree problem
    Han, Lu
    Xu, Dachuan
    Du, Donglei
    Wu, Chenchen
    OPTIMIZATION LETTERS, 2019, 13 (03) : 573 - 585
  • [29] A 5-approximation algorithm for the k-prize-collecting Steiner tree problem
    Lu Han
    Dachuan Xu
    Donglei Du
    Chenchen Wu
    Optimization Letters, 2019, 13 : 573 - 585
  • [30] APPROXIMATION ALGORITHM WITH CONSTANT RATIO FOR STOCHASTIC PRIZE-COLLECTING STEINER TREE PROBLEM
    Sun, Jian
    Sheng, Haiyun
    Sun, Yuefang
    DU, Donglei
    Zhang, Xiaoyan
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2021, 18 (05) : 3351 - 3363
12345