Tight bounds for single-pass streaming complexity of the set cover problem (Q5361872)
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 6784112
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds for single-pass streaming complexity of the set cover problem |
scientific article; zbMATH DE number 6784112 |
Statements
Tight bounds for single-pass streaming complexity of the set cover problem (English)
0 references
29 September 2017
0 references
streaming algorithms
0 references
communication complexity
0 references
covering integer programs
0 references
set cover
0 references
0.9980037212371826
0 references
0.8588816523551941
0 references
0.8549923896789551
0 references
0.8511449694633484
0 references
