The \(b\)-matching problem in hypergraphs: hardness and approximability (Q3167362)
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: The b-matching problem in hypergraphs: hardness and approximability |
scientific article; zbMATH DE number 6101509
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(b\)-matching problem in hypergraphs: hardness and approximability |
scientific article; zbMATH DE number 6101509 |
Statements
The b-Matching Problem in Hypergraphs: Hardness and Approximability (English)
0 references
2 November 2012
0 references
hypergraphs
0 references
matching
0 references
\(L\)-reduction
0 references
Boolean satisfiability
0 references
randomized rounding
0 references
\(\text{Max-Snp}\)-hardness
0 references
0.9217247366905212
0 references
0.8179163336753845
0 references
0.8165597915649414
0 references
0.8062538504600525
0 references
0.7975335717201233
0 references
