Hardness results and approximation algorithms for (weighted) paired-domination in graphs (Q1034626): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.08.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2036622168 / rank | |||
Normal rank | |||
Revision as of 20:27, 19 March 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
