Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs (Q3453563)
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: Inapproximability of Minimum Vertex Cover on k-Uniform k-Partite Hypergraphs |
scientific article; zbMATH DE number 6514447
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs |
scientific article; zbMATH DE number 6514447 |
Statements
Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs (English)
0 references
27 November 2015
0 references
inapproximability
0 references
hypergraph
0 references
vertex cover
0 references
PCP
0 references
0.9800021
0 references
0.9404724
0 references
0.92444247
0 references
0.89515626
0 references
0.8949065
0 references
0.8907174
0 references
0.8841902
0 references
0.8834584
0 references
