Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms (Q2168767)
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 7576501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms |
scientific article; zbMATH DE number 7576501 |
Statements
Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms (English)
0 references
26 August 2022
0 references
\(k\)-submodular
0 references
budget constraint
0 references
approximation algorithm
0 references
streaming algorithm
0 references
0 references
0 references
0.828898012638092
0 references
0.8212327361106873
0 references
0.8188264966011047
0 references
0.8186711072921753
0 references
