The relation of Connected Set Cover and Group Steiner Tree

被引：8
|
作者：
Elbassioni, Khaled [1 ]
Jelic, Slobodan [2 ]
Matijevic, Domagoj [2 ]
机构：
[1] Max Planck Inst Informat, Dept Algorithms & Complex 1, D-66123 Saarbrucken, Germany
[2] Josip Juraj Strossmayer Univ Osijek, Dept Math, Osijek 31000, Croatia
来源：
THEORETICAL COMPUTER SCIENCE | 2012年 / 438卷
关键词：
Set cover; Connected set cover; Weighted connected set cover; Group Steiner tree; Node weighted group Steiner tree; Covering Steiner tree problem;
D O I：
10.1016/j.tcs.2012.02.035
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We report that the Connected Set Cover (CSC) problem is just a special case of the Group Steiner Tree (GST) problem. Based on that we obtain the first algorithm for CSC with polylogarithmic approximation guarantee as well as the first approximation algorithms for the weighted version of the problem and the version with requirements. Moreover, we argue that the inapproximability result of GST will carry on to the weighted version of the CSC problem. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码：96 / 101
页数：6
相关论文
共 50 条
  • [21] Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems
    Lu, Min
    Liu, Tian
    Tong, Weitian
    Lin, Guohui
    Xu, Ke
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2014), 2014, 8402 : 248 - 258
  • [22] New pruning rules for the Steiner tree problem and 2-connected Steiner network problem
    Brazil, Marcus
    Volz, Marcus
    Zachariasen, Martin
    Ras, Charl
    Thomas, Doreen
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2019, 78 : 37 - 49
  • [23] Connected set cover problem and its applications
    Shuai, Tian-Ping
    Hu, Xiao-Dong
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2006, 4041 : 243 - 254
  • [24] Enumerate and expand:: Improved algorithms for connected vertex cover and tree cover
    Moelle, Daniel
    Richter, Stefan
    Rossmanith, Peter
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2006, 3967 : 270 - 280
  • [25] Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
    Daniel Mölle
    Stefan Richter
    Peter Rossmanith
    Theory of Computing Systems, 2008, 43 : 234 - 253
  • [26] Enumerate and expand:: Improved algorithms for connected Vertex Cover and Tree Cover
    Moelle, Daniel
    Richter, Stefan
    Rossmanith, Peter
    THEORY OF COMPUTING SYSTEMS, 2008, 43 (02) : 234 - 253
  • [27] Rectilinear Steiner tree construction using answer set programming
    Erdem, E
    Wong, MDF
    LOGIC PROGRAMMING, PROCEEDINGS, 2004, 3132 : 386 - 399
  • [28] A polylogarithmic approximation algorithm for the group Steiner tree problem
    Garg, N
    Konjevod, G
    Ravi, R
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2000, 37 (01): : 66 - 84
  • [29] New reduction techniques for the group Steiner tree problem
    Ferreira, Carlos Eduardo
    De Oliveira, Fernando M.
    SIAM JOURNAL ON OPTIMIZATION, 2006, 17 (04) : 1176 - 1188
  • [30] Complexity and approximation of the connected set-cover problem
    Zhang, Wei
    Wu, Weili
    Lee, Wonjun
    Du, Ding-Zhu
    JOURNAL OF GLOBAL OPTIMIZATION, 2012, 53 (03) : 563 - 572
12345