On maximizing a monotone \(k\)-submodular function under a knapsack constraint (Q2670465)
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: On maximizing a monotone \(k\)-submodular function under a knapsack constraint |
scientific article; zbMATH DE number 7487759
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On maximizing a monotone \(k\)-submodular function under a knapsack constraint |
scientific article; zbMATH DE number 7487759 |
Statements
On maximizing a monotone \(k\)-submodular function under a knapsack constraint (English)
0 references
11 March 2022
0 references
\(k\)-submodularity
0 references
knapsack
0 references
approximation algorithms
0 references
0 references
0 references
