A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614)
From MaRDI portal
scientific article; zbMATH DE number 6544302
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
