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 条
  • [31] Complexity and approximation of the connected set-cover problem
    Wei Zhang
    Weili Wu
    Wonjun Lee
    Ding-Zhu Du
    Journal of Global Optimization, 2012, 53 : 563 - 572
  • [32] A 2-approximation NC algorithm for connected vertex cover and tree cover
    Fujito, T
    Doi, T
    INFORMATION PROCESSING LETTERS, 2004, 90 (02) : 59 - 63
  • [33] Online Deterministic Algorithms for Connected Dominating Set & Set Cover Leasing Problems
    Markarian, Christine
    Kassar, Abdul-Nasser
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON OPERATIONS RESEARCH AND ENTERPRISE SYSTEMS (ICORES), 2020, : 121 - 128
  • [34] The Euclidean bottleneck Steiner tree and Steiner tree with minimum number of Steiner points
    Du, DZ
    Wang, LS
    Xu, BA
    COMPUTING AND COMBINATORICS, 2001, 2108 : 509 - 518
  • [35] The core cover in relation to the nucleolus and the Weber set
    Quant, M
    Borm, P
    Reijnierse, H
    van Velzen, B
    INTERNATIONAL JOURNAL OF GAME THEORY, 2005, 33 (04) : 491 - 503
  • [36] The core cover in relation to the nucleolus and the Weber set
    Marieke Quant
    Peter Borm
    Hans Reijnierse
    Bas van Velzen
    International Journal of Game Theory, 2005, 33 : 491 - 503
  • [37] Algorithms for Steiner Connected Dominating Set Problem Based on Learning Automata Theory
    Torkestani, Javad Akbari
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (06) : 769 - 801
  • [38] The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern
    Krauthgamer, Robert
    Trabelsi, Ohad
    36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019), 2019,
  • [39] An approximation algorithm for maximum weight budgeted connected set cover
    Yingli Ran
    Zhao Zhang
    Ker-I Ko
    Jun Liang
    Journal of Combinatorial Optimization, 2016, 31 : 1505 - 1517
  • [40] An approximation algorithm for maximum weight budgeted connected set cover
    Ran, Yingli
    Zhang, Zhao
    Ko, Ker-I
    Liang, Jun
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (04) : 1505 - 1517
12345