A note on `Algorithms for connected set cover problem and fault-tolerant connected set cover problem'
type: Item
instance of: scholarly article
title: A note on `Algorithms for connected set cover problem and fault-tolerant connected set cover problem'
zbMATH Open document ID: 1230.68216
author: Wei Ren
author: Qing Zhao
published in: Theoretical Computer Science
publication date: 2012-01-09T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5995835
zbMATH Keywords: minimum connected set cover problem
zbMATH Keywords: approximation ratio
zbMATH Keywords: connected dominating set problem
zbMATH Keywords: greedy algorithm
MaRDI profile type: MaRDI publication profile
full work available at URL: j.tcs.2011.07.008
OpenAlex ID: W1995707367
cites work: Algorithms for connected set cover problem and fault-tolerant connected set cover problem
cites work: A threshold of ln n for approximating set cover
cites work: Approximation algorithms for connected dominating sets
DOI: 10.1016/J.TCS.2011.07.008
Recommended article: Algorithms for connected set cover problem and fault-tolerant connected set cover problem
Recommended article: Complexity and approximation of the connected set-cover problem
Recommended article: Connected Set Cover Problem and Its Applications
Recommended article: A greedy algorithm for the fault-tolerant connected dominating set in a general graph
Recommended article: An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets
Recommended article: Approximating node connectivity problems via set covers
Recommended article: Q2753740
Recommended article: A greedy algorithm for the fault-tolerant outer-connected dominating set problem
Recommended article: An approximation algorithm for maximum weight budgeted connected set cover
Recommended article: A survey on the problems and algorithms for covering arrays via set covers
description: scientific article; zbMATH DE number 5995835