\textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization (Q6180752): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2023.114320 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4389060545 / rank | |||
Normal rank | |||
Revision as of 08:50, 30 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
