Greedy approximation for the minimum connected dominating set with labeling (Q828691)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7343974
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Greedy approximation for the minimum connected dominating set with labeling |
scientific article; zbMATH DE number 7343974 |
Statements
Greedy approximation for the minimum connected dominating set with labeling (English)
0 references
5 May 2021
0 references
greedy algorithm
0 references
connected dominating set
0 references
approximation algorithm
0 references
performance ratio
0 references
labeling
0 references
0 references
0.8325777649879456
0 references
0.8325777649879456
0 references
0.8288877606391907
0 references
0.8282665014266968
0 references
0.8172957897186279
0 references
