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 条
  • [41] THE NP-COMPLETENESS OF STEINER TREE AND DOMINATING SET FOR CHORDAL BIPARTITE GRAPHS
    MULLER, H
    BRANDSTADT, A
    THEORETICAL COMPUTER SCIENCE, 1987, 53 (2-3) : 257 - 265
  • [42] Weighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs
    Javad Akbari Torkestani
    Mohammad Reza Meybodi
    Wireless Personal Communications, 2011, 60 : 145 - 169
  • [43] Weighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs
    Torkestani, Javad Akbari
    Meybodi, Mohammad Reza
    WIRELESS PERSONAL COMMUNICATIONS, 2011, 60 (02) : 145 - 169
  • [44] Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph
    Buchanan, Austin
    Wang, Yiming
    Butenko, Sergiy
    NETWORKS, 2018, 72 (02) : 238 - 248
  • [45] A-ary tree-based minimum exact cover of leaf set for secure group communication in grids
    Xu, Shouzhi
    Jiang, Tingyao
    Zhong, Alin
    Yang, Wangmin
    Zhang, Lili
    Liu, Qiaoli
    SIXTH INTERNATIONAL CONFERENCE ON GRID AND COOPERATIVE COMPUTING, PROCEEDINGS, 2007, : 11 - +
  • [46] General variable neighborhood search approach to group steiner tree problem
    Matijevic, Luka
    Jelic, Slobodan
    Davidovic, Tatjana
    OPTIMIZATION LETTERS, 2023, 17 (09) : 2087 - 2111
  • [47] General variable neighborhood search approach to group steiner tree problem
    Luka Matijević
    Slobodan Jelić
    Tatjana Davidović
    Optimization Letters, 2023, 17 : 2087 - 2111
  • [48] Multicriteria Steiner tree with the cost of Steiner vertices
    Levin, M. Sh
    Zamkovoy, A. A.
    JOURNAL OF COMMUNICATIONS TECHNOLOGY AND ELECTRONICS, 2011, 56 (12) : 1527 - 1542
  • [49] Multicriteria Steiner tree with the cost of Steiner vertices
    M. Sh. Levin
    A. A. Zamkovoy
    Journal of Communications Technology and Electronics, 2011, 56 : 1527 - 1542
  • [50] On Approximating (Connected) 2-Edge Dominating Set by a Tree
    Fujito, Toshihiro
    Shimoda, Tomoaki
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, CSR 2016, 2016, 9691 : 161 - 176
12345