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 条
  • [41] A practical greedy approximation for the directed Steiner tree problem
    Dimitri Watel
    Marc-Antoine Weisser
    Journal of Combinatorial Optimization, 2016, 32 : 1327 - 1370
  • [42] Approximation algorithms for the rectilinear Steiner tree problem with obstacles
    Fujimoto, M
    Takafuji, D
    Watanabe, T
    2005 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), VOLS 1-6, CONFERENCE PROCEEDINGS, 2005, : 1362 - 1365
  • [43] Some formulations for the group steiner tree problem
    Ferreira, Carlos E.
    de Oliveira Filho, Fernando M.
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (13) : 1877 - 1884
  • [44] An FPTAS for the fractional group Steiner tree problem
    Jelic, Slobodan
    CROATIAN OPERATIONAL RESEARCH REVIEW, 2015, 6 (02) : 525 - 539
  • [45] An Estimation of Distribution Algorithm for Steiner Tree Problem
    Wang, Yaqing
    Wang, Hua
    Kong, Guohong
    2013 IEEE 15TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS & 2013 IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING (HPCC_EUC), 2013, : 1687 - 1692
  • [46] An evolution algorithm for the rectilinear Steiner tree problem
    Yang, B
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2005, VOL 4, PROCEEDINGS, 2005, 3483 : 241 - 249
  • [47] An ant algorithm for the Steiner Tree Problem in graphs
    Luyet, Luc
    Varone, Sacha
    Zufferey, Nicolas
    APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2007, 4448 : 42 - +
  • [48] An efficient 3-approximation algorithm for the Steiner tree problem with the minimum number of Steiner points and bounded edge length
    Shin, Donghoon
    Choi, Sunghee
    PLOS ONE, 2023, 18 (11):
  • [49] Improved approximation algorithms for the Quality of Service Steiner Tree Problem
    Karpinski, M
    Mandoiu, II
    Olshevsky, A
    Zelikovsky, A
    ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2003, 2748 : 401 - 411
  • [50] A series of approximation algorithms for the acyclic directed steiner tree problem
    A. Zelikovsky
    Algorithmica, 1997, 18 : 99 - 110
12345