Nearly tight approximation algorithm for (connected) Roman dominating set (Q2080821)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nearly tight approximation algorithm for (connected) Roman dominating set |
scientific article |
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
