Tight bounds for single-pass streaming complexity of the set cover problem (Q5361872): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2300360052 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1603.05715 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:27, 20 April 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
