Maximize an approximate \(k\)-submodular function under a knapsack constraint (Q6909251)
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 8112791
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximize an approximate \(k\)-submodular function under a knapsack constraint |
scientific article; zbMATH DE number 8112791 |
Statements
Maximize an approximate \(k\)-submodular function under a knapsack constraint (English)
0 references
29 October 2025
0 references
approximate \(k\)-submodular function
0 references
knapsack
0 references
greedy algorithm
0 references
0 references
0 references
0 references
