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 the normal view instead:
scientific article; zbMATH DE number 7487759
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.925141453742981
0 references
0.908218502998352
0 references
0.8988608121871948
0 references
0.8967915177345276
0 references
0.8761311173439026
0 references
