Submodular secretary problem and extensions (Q2933663)
From MaRDI portal
!
WARNING
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 6377172
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Submodular secretary problem and extensions |
scientific article; zbMATH DE number 6377172 |
Statements
Submodular secretary problem and extensions (English)
0 references
5 December 2014
0 references
stopping theory
0 references
competitive algorithms
0 references
knapsack constraint
0 references
matroid constraint
0 references
online algorithms
0 references
secretary problem
0 references
submodular
0 references
0.9981982707977296
0 references
0.9175463914871216
0 references
0.880118727684021
0 references
0.8791652321815491
0 references
0.8772417902946472
0 references
