Solving the minimum-cost double Roman domination problem (Q6608515)
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 7916335
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the minimum-cost double Roman domination problem |
scientific article; zbMATH DE number 7916335 |
Statements
Solving the minimum-cost double Roman domination problem (English)
0 references
20 September 2024
0 references
dominating set
0 references
double Roman domination
0 references
minimum cost
0 references
complexity
0 references
dynamic programming
0 references
heuristic
0 references
0.8090415000915527
0 references
0.8085291385650635
0 references
0.8035710453987122
0 references
0.8032429814338684
0 references
0.801961362361908
0 references
