Connected Set Cover Problem and Its Applications
From MaRDI portal
Publication:5434403
DOI10.1007/11775096_23zbMATH Open1137.90699OpenAlexW1870820630MaRDI QIDQ5434403FDOQ5434403
Authors: Tianping Shuai, Xiaodong Hu 
Publication date: 4 January 2008
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11775096_23
Recommendations
- Complexity and approximation of the connected set-cover problem
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem
- Approximating node connectivity problems via set covers
- scientific article; zbMATH DE number 1670542
- scientific article; zbMATH DE number 3908486
- Problems and algorithms for covering arrays via set covers
- Connected dominating set. Theory and applications
- Requiring connectivity in the set covering problem
- Complexity and Approximation Results for the Connected Vertex Cover Problem
- An approach to the solution of the set-covering problem
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cited In (9)
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem
- The Set Connector Problem in Graphs
- The relation of connected set cover and group Steiner tree
- Complexity and approximation of the connected set-cover problem
- Approximation algorithms for minimum weight partial connected set cover problem
- A simple approximation algorithm for minimum weight partial connected set cover
- On the hardness of full Steiner tree problems
- A note on `Algorithms for connected set cover problem and fault-tolerant connected set cover problem'
- Requiring connectivity in the set covering problem
This page was built for publication: Connected Set Cover Problem and Its Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434403)
