Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint (Q2191293): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s11590-019-01430-z / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127913651 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11590-019-01430-Z / rank | |||
Normal rank | |||
Latest revision as of 10:19, 17 December 2024
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
0 references
0 references
