A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692)
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 fault-tolerant connected dominating set in a general graph |
scientific article; zbMATH DE number 6340727
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A greedy algorithm for the fault-tolerant connected dominating set in a general graph |
scientific article; zbMATH DE number 6340727 |
Statements
A greedy algorithm for the fault-tolerant connected dominating set in a general graph (English)
0 references
5 September 2014
0 references
\(m\)-fold connected dominating set
0 references
non-submodular potential function
0 references
greedy algorithm
0 references
0 references
0 references
0.9064375758171082
0 references
0.8851685523986816
0 references
0.8623090386390686
0 references
0.8574549555778503
0 references
0.8528019785881042
0 references
