Complexity of approximating bounded variants of optimization problems (Q2368970)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5020375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of approximating bounded variants of optimization problems |
scientific article; zbMATH DE number 5020375 |
Statements
Complexity of approximating bounded variants of optimization problems (English)
0 references
28 April 2006
0 references
approximation hardness
0 references
bounded degree graphs
0 references
vertex cover
0 references
independent set
0 references
three-dimensional matching
0 references
0.9235799
0 references
0.9143377
0 references
0.9102217
0 references
0 references
0 references
