A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614)
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 greedy algorithm for the minimum 2-connected m-fold dominating set problem |
scientific article; zbMATH DE number 6544302
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem |
scientific article; zbMATH DE number 6544302 |
Statements
A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (English)
0 references
23 February 2016
0 references
fault-tolerant connected dominating set
0 references
greedy algorithm
0 references
non-submodular potential function
0 references
0 references
0 references
0 references
0 references
0.9064375758171082
0 references
0.8747117519378662
0 references
0.870873212814331
0 references
0.8613262176513672
0 references
0.8487749695777893
0 references
