A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem (Q5219558)

From MaRDI portal
Revision as of 01:43, 22 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    12 March 2020
    0 references
    matroids
    0 references
    online algorithms
    0 references
    secretary problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references