Ranking with submodular functions on a budget (Q2147409)
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: Ranking with submodular functions on a budget |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ranking with submodular functions on a budget |
scientific article |
Statements
Ranking with submodular functions on a budget (English)
0 references
20 June 2022
0 references
ranking
0 references
submodular maximization
0 references
dynamic programming
0 references
approximation algorithms
0 references
0 references
0.8344596028327942
0 references
0.7977645397186279
0 references
0.7961623668670654
0 references
0.793670117855072
0 references
