Algorithms for connected set cover problem and fault-tolerant connected set cover problem

被引：20

作者：

Zhang, Zhao ^{[1
]}

Gao, Xiaofeng ^{[2
]}

Wu, Weili ^{[2
]}

机构：

[1] Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China

[2] Univ Texas Dallas, Dept Comp Sci, Richardson, TX 75080 USA

来源：

THEORETICAL COMPUTER SCIENCE | 2009年 / 410卷 / 8-10期

基金：

美国国家科学基金会;

关键词：

Reserve system; Connected set cover; Fault-tolerant; MINIMUM NUMBER; STEINER TREES; SELECTION;

D O I：

10.1016/j.tcs.2008.11.005

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Given a set V of elements, S a family of subsets of V, and G a connected graph on vertex set S,a connected set cover (CSC) is a subfamily R of S such that every element in V is covered by at least one set of R, and the subgraph G[R] of G induced by R is connected. If furthermore G[R] is k-connected and every element in V is covered by at least m sets in R, then R is a (k, m)-CSC. In this paper, we present two approximation algorithms for the minimum CSC problem, and one approximation algorithm for the minimum (2, m)-CSC problem. Performance ratios are analyzed. These are the first approximation algorithms for CSC problems in general graphs with guaranteed performance ratios. (C) 2008 Elsevier B.V. All rights reserved.

引用

页码：812 / 817

页数：6

共 50 条

[31] A Θ(log n)-approximation for the set cover problem with set ownership
Gonen, Mira
Shavitt, Yuval
INFORMATION PROCESSING LETTERS, 2009, 109 (03) : 183 - 186
[32] Set It and Forget It: Approximating the Set Once Strip Cover Problem
Bar-Noy, Amotz
Baumer, Ben
Rawitz, Dror
ALGORITHMICA, 2017, 79 (02) : 368 - 386
[33] Complexity and algorithms for the connected vertex cover problem in 4-regular graphs
Li, Yuchao
Yang, Zishen
Wang, Wei
APPLIED MATHEMATICS AND COMPUTATION, 2017, 301 : 107 - 114
[34] A fault-tolerant and distributed capacitated connected dominating set algorithm for wireless sensor networks
Arapoglu, Ozkan
Dagdeviren, Orhan
COMPUTER STANDARDS & INTERFACES, 2021, 77 (77)
[35] The minimum-entropy set cover problem
Halperin, E
Karp, RM
THEORETICAL COMPUTER SCIENCE, 2005, 348 (2-3) : 240 - 250
[36] An effective algorithm for the minimum set cover problem
Zhang, Pei
Wang, Rong-Long
Wu, Chong-Guang
Okazaki, Kozo
PROCEEDINGS OF 2006 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2006, : 3032 - +
[37] The minimum-entropy set cover problem
Halperin, E
Karp, RM
AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 733 - 744
[38] On Streaming and Communication Complexity of the Set Cover Problem
Demaine, Erik D.
Indyk, Piotr
Mahabadi, Sepideh
Vakilian, Ali
DISTRIBUTED COMPUTING (DISC 2014), 2014, 8784 : 484 - 498
[39] The Minimum Entropy Submodular Set Cover Problem
Istrate, Gabriel
Bonchis, Cosmin
Dinu, Liviu P.
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, LATA 2016, 2016, 9618 : 295 - 306
[40] Cover set problem in directional sensor networks
Cai, Yanli
Lou, Wei
Li, Minglu
PROCEEDINGS OF FUTURE GENERATION COMMUNICATION AND NETWORKING, MAIN CONFERENCE PAPERS, VOL 1, 2007, : 273 - +

← 1 2 3 4 5 →