Approximation algorithm for a generalized Roman domination problem in unit ball graphs (Q2292134)
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: Approximation algorithm for a generalized Roman domination problem in unit ball graphs |
scientific article; zbMATH DE number 7161776
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithm for a generalized Roman domination problem in unit ball graphs |
scientific article; zbMATH DE number 7161776 |
Statements
Approximation algorithm for a generalized Roman domination problem in unit ball graphs (English)
0 references
3 February 2020
0 references
connected strong \(k\)-Roman dominating set
0 references
constant approximation algorithm
0 references
unit ball graph
0 references
0.8665257096290588
0 references
0.8158881068229675
0 references
0.7854894995689392
0 references
0.7740939855575562
0 references
0.7684739232063293
0 references
