An improved analysis of the Greedy+Singleton algorithm for \(k\)-submodular knapsack maximization (Q6535797)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7810579
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved analysis of the Greedy+Singleton algorithm for \(k\)-submodular knapsack maximization |
scientific article; zbMATH DE number 7810579 |
Statements
An improved analysis of the Greedy+Singleton algorithm for \(k\)-submodular knapsack maximization (English)
0 references
28 February 2024
0 references
\(k\)-submodularity
0 references
greedy
0 references
knapsack
0 references
approximation
0 references
0 references
0 references
0 references
0.952695608139038
0 references
0.8934962153434753
0 references
0.8831644654273987
0 references
0.8750247955322266
0 references
0.8613633513450623
0 references
