Hardness results and approximation algorithms of \(k\)-tuple domination in graphs (Q1029052)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness results and approximation algorithms of \(k\)-tuple domination in graphs |
scientific article |
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
