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
scientific article; zbMATH DE number 7304028
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
