Inapproximability of hypergraph vertex cover and applications to scheduling problems (Q3587384)
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 hypergraph vertex cover and applications to scheduling problems |
scientific article; zbMATH DE number 5780445
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inapproximability of hypergraph vertex cover and applications to scheduling problems |
scientific article; zbMATH DE number 5780445 |
Statements
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems (English)
0 references
7 September 2010
0 references
0.8026637434959412
0 references
0.8014417886734009
0 references
0.7985734939575195
0 references
0.7914890050888062
0 references
