Hardness results and approximation algorithms of \(k\)-tuple domination in graphs (Q1029052)
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: Hardness results and approximation algorithms of \(k\)-tuple domination in graphs |
scientific article; zbMATH DE number 5576924
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness results and approximation algorithms of \(k\)-tuple domination in graphs |
scientific article; zbMATH DE number 5576924 |
Statements
Hardness results and approximation algorithms of \(k\)-tuple domination in graphs (English)
0 references
9 July 2009
0 references
approximation algorithms
0 references
combinatorial problems
0 references
domination problems
0 references
