Tight bounds on subexponential time approximation of set cover and related problems (Q2117696)
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 7495125
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds on subexponential time approximation of set cover and related problems |
scientific article; zbMATH DE number 7495125 |
Statements
Tight bounds on subexponential time approximation of set cover and related problems (English)
0 references
22 March 2022
0 references
subexponential time algorithms
0 references
lower bounds
0 references
set cover
0 references
0 references
0 references
0.92852986
0 references
0 references
0.92018056
0 references
0.92018056
0 references
0.90812993
0 references
0.9078107
0 references
0.90530694
0 references
0.90487224
0 references
0.90487224
0 references
