Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:18, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vertex cover might be hard to approximate to within \(2 - \varepsilon \) |
scientific article |
Statements
Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (English)
0 references
11 March 2008
0 references
hardness of approximation
0 references
vertex cover
0 references
unique games conjecture
0 references
