Nearly tight approximation algorithm for (connected) Roman dominating set (Q2080821)
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: Nearly tight approximation algorithm for (connected) Roman dominating set |
scientific article; zbMATH DE number 7599787
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nearly tight approximation algorithm for (connected) Roman dominating set |
scientific article; zbMATH DE number 7599787 |
Statements
Nearly tight approximation algorithm for (connected) Roman dominating set (English)
0 references
11 October 2022
0 references
Roman dominating set
0 references
connected Roman dominating set
0 references
non-submodular optimization
0 references
greedy algorithm
0 references
approxiamtion ratio
0 references
0.9197778
0 references
0.9197778
0 references
0.9154659
0 references
0.9129601
0 references
0.9116132
0 references
0.91113836
0 references
0.9087099
0 references
0.9000792
0 references
0.8997271
0 references
