Approximation algorithm for the minimum partial connected Roman dominating set problem (Q6571270)
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 7880134
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithm for the minimum partial connected Roman dominating set problem |
scientific article; zbMATH DE number 7880134 |
Statements
Approximation algorithm for the minimum partial connected Roman dominating set problem (English)
0 references
11 July 2024
0 references
partial connected Roman dominating set
0 references
approximation algorithm
0 references
quota Steiner tree
0 references
0 references
0.8925318717956543
0 references
0.8205037713050842
0 references
0.807727575302124
0 references
0.8060724139213562
0 references
0.8058125376701355
0 references
