A natural family of optimization problems with arbitrarily small approximation thresholds (Q293457)
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: A natural family of optimization problems with arbitrarily small approximation thresholds |
scientific article; zbMATH DE number 6590798
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A natural family of optimization problems with arbitrarily small approximation thresholds |
scientific article; zbMATH DE number 6590798 |
Statements
A natural family of optimization problems with arbitrarily small approximation thresholds (English)
0 references
9 June 2016
0 references
approximation algorithm
0 references
NP-hardness
0 references
hardness of approximation
0 references
approximation threshold
0 references
PTAS
0 references
independent set problem
0 references
total graphs
0 references
edge domination
0 references
computational complexity
0 references
0.7378568649291992
0 references
0.7376599311828613
0 references
0.7368990778923035
0 references
