\textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization (Q6180752): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:01, 10 July 2024
scientific article; zbMATH DE number 7782075
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
