A note on `Algorithms for connected set cover problem and fault-tolerant connected set cover problem' (Q653341)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on `Algorithms for connected set cover problem and fault-tolerant connected set cover problem' |
scientific article; zbMATH DE number 5995835
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on `Algorithms for connected set cover problem and fault-tolerant connected set cover problem' |
scientific article; zbMATH DE number 5995835 |
Statements
A note on `Algorithms for connected set cover problem and fault-tolerant connected set cover problem' (English)
0 references
9 January 2012
0 references
minimum connected set cover problem
0 references
approximation ratio
0 references
connected dominating set problem
0 references
greedy algorithm
0 references
0.9614543
0 references
0.8896684
0 references
0.8851957
0 references
0.86799514
0 references
0.8675528
0 references
0.8674078
0 references
0.8615412
0 references
0.8606354
0 references
