Hardness results and approximation algorithms for (weighted) paired-domination in graphs (Q1034626): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:34, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness results and approximation algorithms for (weighted) paired-domination in graphs |
scientific article |
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
