The one-way communication complexity of submodular maximization with applications to streaming and robustness (Q5145019)
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 7298334
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The one-way communication complexity of submodular maximization with applications to streaming and robustness |
scientific article; zbMATH DE number 7298334 |
Statements
The one-way communication complexity of submodular maximization with applications to streaming and robustness (English)
0 references
19 January 2021
0 references
approximation algorithms
0 references
communication complexity
0 references
robustness
0 references
streaming
0 references
submodular maximization
0 references
0.8661236
0 references
0.85057324
0 references
0.84853244
0 references
0.84792346
0 references
0.84586203
0 references
0.8454495
0 references
0.84422207
0 references
0.8418717
0 references
