Inapproximability of \(b\)-matching in \(k\)-uniform hypergraphs (Q3078381)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5853602
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inapproximability of \(b\)-matching in \(k\)-uniform hypergraphs |
scientific article; zbMATH DE number 5853602 |
Statements
Inapproximability of b-Matching in k-Uniform Hypergraphs (English)
0 references
20 February 2011
0 references
hardness of approximation
0 references
approximation algorithms
0 references
gap problem
0 references
colorability
0 references
probabilistic methods
0 references
NP-hardness
0 references
0.9217247366905212
0 references
0.8396270275115967
0 references
0.830017626285553
0 references
0.8048796653747559
0 references
0.8010490536689758
0 references
