\textsc{Greedy+Max}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization (Q6606191)
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+Max}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization |
scientific article; zbMATH DE number 7914073
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \textsc{Greedy+Max}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization |
scientific article; zbMATH DE number 7914073 |
Statements
\textsc{Greedy+Max}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization (English)
0 references
16 September 2024
0 references
\(k\)-submodularity
0 references
knapsack constraint
0 references
approximation
0 references
0 references
0 references
