Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint (Q2191293)
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 algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint |
scientific article |
Statements
Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint (English)
0 references
24 June 2020
0 references
streaming
0 references
non-submodular
0 references
\(d\)-knapsack constraint
0 references