A note on `Algorithms for connected set cover problem and fault-tolerant connected set cover problem'
DOI10.1016/J.TCS.2011.07.008zbMATH Open1230.68216OpenAlexW1995707367MaRDI QIDQ653341FDOQ653341
Publication date: 9 January 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.07.008
Recommendations
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem
- Complexity and approximation of the connected set-cover problem
- Connected Set Cover Problem and Its Applications
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph
- An integer programming approach for fault-tolerant connected dominating sets
- Approximating node connectivity problems via set covers
- scientific article; zbMATH DE number 1670542
- A greedy algorithm for the fault-tolerant outer-connected dominating set problem
- An approximation algorithm for maximum weight budgeted connected set cover
- A survey on the problems and algorithms for covering arrays via set covers
greedy algorithmapproximation ratioconnected dominating set problemminimum connected set cover problem
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (2)
This page was built for publication: A note on `Algorithms for connected set cover problem and fault-tolerant connected set cover problem'
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q653341)
