Robust Approximation Algorithms for Non-monotone $k$-Submodular Maximization under a Knapsack Constraint (Q6452066)
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: Robust Approximation Algorithms for Non-monotone $k$-Submodular Maximization under a Knapsack Constraint |
scientific article; zbMATH DE number 902330950
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Robust Approximation Algorithms for Non-monotone $k$-Submodular Maximization under a Knapsack Constraint |
scientific article; zbMATH DE number 902330950 |
Statements
21 September 2023
0 references
cs.DS
0 references
cs.CC
0 references
cs.LG
0 references
math.CO
0 references
