Strong algorithms for the ordinal matroid secretary problem (Q5000649)
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: Strong algorithms for the ordinal matroid secretary problem |
scientific article; zbMATH DE number 7371746
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong algorithms for the ordinal matroid secretary problem |
scientific article; zbMATH DE number 7371746 |
Statements
Strong Algorithms for the Ordinal Matroid Secretary Problem (English)
0 references
15 July 2021
0 references
secretary problem
0 references
matroids
0 references
online algorithms
0 references
0 references
0 references
0.975149393081665
0 references
0.8623494505882263
0 references
0.8611268401145935
0 references
0.8532732725143433
0 references
0.8510079383850098
0 references
