NP-completeness and APX-completeness of restrained domination in graphs (Q442103)
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: NP-completeness and APX-completeness of restrained domination in graphs |
scientific article; zbMATH DE number 6064501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-completeness and APX-completeness of restrained domination in graphs |
scientific article; zbMATH DE number 6064501 |
Statements
NP-completeness and APX-completeness of restrained domination in graphs (English)
0 references
9 August 2012
0 references
NP-complete
0 references
APX-complete
0 references
approximation ratio
0 references
domination problems
0 references
restrained domination
0 references
0 references
0 references
0.9008195
0 references
0 references
0.89486736
0 references
0 references
0 references
0.8908536
0 references
0 references
0.8888818
0 references
