Tight bounds for single-pass streaming complexity of the set cover problem (Q5361872): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:26, 9 February 2024
scientific article; zbMATH DE number 6784112
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
