Complexity of approximating bounded variants of optimization problems (Q2368970)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of approximating bounded variants of optimization problems |
scientific article |
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 references
