Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058)
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: Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem |
scientific article; zbMATH DE number 6057750
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem |
scientific article; zbMATH DE number 6057750 |
Statements
Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (English)
0 references
17 July 2012
0 references
\(k\)-fold dominating set
0 references
slab decomposition
0 references
algorithm
0 references
unit ball graph
0 references
0 references
0 references
0.9651677
0 references
0.9452317
0 references
0.93165326
0 references
0.9231661
0 references
0.92242014
0 references
0.9156576
0 references
0.9091591
0 references
0.9091591
0 references
