A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem (Q5219558)
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: A simple O((rank))-competitive algorithm for the matroid secretary problem |
scientific article; zbMATH DE number 7179757
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem |
scientific article; zbMATH DE number 7179757 |
Statements
A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem (English)
0 references
12 March 2020
0 references
matroids
0 references
online algorithms
0 references
secretary problem
0 references
0 references
0.9970744848251344
0 references
0.9048892855644226
0 references
0.875456690788269
0 references
0.8650562167167664
0 references
0.8587461113929749
0 references
