\textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization (Q6180752)
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: \textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization |
scientific article; zbMATH DE number 7782075
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization |
scientific article; zbMATH DE number 7782075 |
Statements
\textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization (English)
0 references
2 January 2024
0 references
submodularity
0 references
approximation algorithm
0 references
greedy algorithm
0 references
knapsack
0 references
0 references
0 references
0 references
0 references
