Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs (Q3088179)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs |
scientific article |
Statements
Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs (English)
0 references
19 August 2011
0 references
complexity of approximation
0 references
combinatorial optimization problems
0 references
vertex cover
0 references
PCP
0 references
regular hypergraphs
0 references
