A greedy approximation for minimum connected dominating sets (Q706637)
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 approximation for minimum connected dominating sets |
scientific article; zbMATH DE number 2132508
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A greedy approximation for minimum connected dominating sets |
scientific article; zbMATH DE number 2132508 |
Statements
A greedy approximation for minimum connected dominating sets (English)
0 references
9 February 2005
0 references
Connected dominating set
0 references
greedy approximation
0 references
0 references
0.8690618276596069
0 references
0.8597862124443054
0 references
0.8430014252662659
0 references
0.8430014252662659
0 references
0.8418405055999756
0 references
