Tight Running Time Lower Bounds for Strong Inapproximability of Maximum <i>k</i>-Coverage, Unique Set Cover and Related Problems (via <i>t</i>-Wise Agreement Testing Theorem) (Q5146765)
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 7304028
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight Running Time Lower Bounds for Strong Inapproximability of Maximum <i>k</i>-Coverage, Unique Set Cover and Related Problems (via <i>t</i>-Wise Agreement Testing Theorem) |
scientific article; zbMATH DE number 7304028 |
Statements
Tight Running Time Lower Bounds for Strong Inapproximability of Maximum <i>k</i>-Coverage, Unique Set Cover and Related Problems (via <i>t</i>-Wise Agreement Testing Theorem) (English)
0 references
2 February 2021
0 references
0.7818962931632996
0 references
0.7801048159599304
0 references
0.7786799073219299
0 references
0.7575244903564453
0 references
0.7509064674377441
0 references
