A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem (Q5363101)
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 6786416
| 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 6786416 |
Statements
A Simple <tt><i>O</i>(log log(rank))</tt>-Competitive Algorithm for the Matroid Secretary Problem (English)
0 references
5 October 2017
0 references
0.9970744848251344
0 references
0.9032391905784608
0 references
0.8695937991142273
0 references
0.861579179763794
0 references
0.8553837537765503
0 references
