Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q2300732)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint |
scientific article; zbMATH DE number 7175615
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint |
scientific article; zbMATH DE number 7175615 |
Statements
Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (English)
0 references
28 February 2020
0 references
submodular functions
0 references
single-pass streaming
0 references
multiple-pass streaming
0 references
constant approximation
0 references
0 references
0 references
0 references
1.0000001
0 references
0.98467785
0 references
0.98467785
0 references
0.9743504
0 references
0.96914625
0 references
0.95700574
0 references
0.9496525
0 references
0.94634306
0 references
0.9405106
0 references
