Hardness results and approximation algorithms for (weighted) paired-domination in graphs (Q1034626)
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 for (weighted) paired-domination in graphs |
scientific article; zbMATH DE number 5626973
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness results and approximation algorithms for (weighted) paired-domination in graphs |
scientific article; zbMATH DE number 5626973 |
Statements
Hardness results and approximation algorithms for (weighted) paired-domination in graphs (English)
0 references
6 November 2009
0 references
approximation algorithms
0 references
\(APX\)-complete
0 references
combinatorial problems
0 references
domination problems
0 references
paired-domination
0 references
