A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem (Q5219558): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:51, 8 February 2024
scientific article; zbMATH DE number 7179757
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Simple <i>O</i>(log log(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
