Approximation of set multi-cover via hypergraph matching (Q2207501)
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 7264850
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation of set multi-cover via hypergraph matching |
scientific article; zbMATH DE number 7264850 |
Statements
Approximation of set multi-cover via hypergraph matching (English)
0 references
22 October 2020
0 references
approximation algorithms
0 references
unique games conjecture
0 references
hypergraphs
0 references
\(k\)-matching and covering problem
0 references
0 references
0.9341980814933776
0 references
0.8925359845161438
0 references
0.8358701467514038
0 references
0.8251142501831055
0 references
0.8179163336753845
0 references
