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 条
  • [1] Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts
    Cornet, Alexis
    Laforest, Christian
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2017, 19 (03):
  • [2] Total domination, connected vertex cover and steiner tree with conflicts
    2017, Discrete Mathematics and Theoretical Computer Science (19):
  • [3] Sublinear Metric Steiner Tree via Improved Bounds for Set Cover
    Mahabadi, Sepideh
    Roghani, Mohammad
    Tarnawski, Jakub
    Vakilian, Ali
    arXiv,
  • [4] Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs
    de Figueiredo, Celina M. H.
    Lopes, Raul
    de Melo, Alexsander A.
    Silva, Ana
    NETWORKS, 2024, 84 (02) : 132 - 147
  • [5] Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks
    Manki Min
    Hongwei Du
    Xiaohua Jia
    Christina Xiao Huang
    Scott C.-H. Huang
    Weili Wu
    Journal of Global Optimization, 2006, 35 : 111 - 119
  • [6] Improving construction for connected dominating set with Steiner tree in wireless sensor networks
    Min, Manki
    Du, Hongwei
    Jia, Xiaohua
    Huang, Christina Xiao
    Huang, Scott C. -H.
    Wu, Weili
    JOURNAL OF GLOBAL OPTIMIZATION, 2006, 35 (01) : 111 - 119
  • [7] STEINER SET AND CONNECTED DOMINATION IN TRAPEZOID GRAPHS
    LIANG, YD
    INFORMATION PROCESSING LETTERS, 1995, 56 (02) : 101 - 108
  • [8] Approximation Algorithms for Steiner Connected Dominating Set
    Ya-Feng Wu
    Yin-Long Xu
    Guo-Liang Chen
    Journal of Computer Science and Technology, 2005, 20 : 713 - 716
  • [9] Approximation algorithms for Steiner connected dominating set
    Wu, YF
    Xu, YL
    Chen, GL
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2005, 20 (05) : 713 - 716
  • [10] Algorithms for connected set cover problem and fault-tolerant connected set cover problem
    Zhang, Zhao
    Gao, Xiaofeng
    Wu, Weili
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (8-10) : 812 - 817
12345