A simple O(loglog(rank))-competitive algorithm for the matroid secretary problem - Research Collection

Metadata only

Autor(in)

Zenklusen, Rico

Datum

2018-05

Typ

Journal Article

Zitate

7 Zitate in Web of Science

11 Zitate in Scopus

ETH Bibliographie

yes

Altmetrics

Publikationsstatus

published

Externe Links

https://doi.org/10.1287/moor.2017.0876

Zeitschrift / Serie

Mathematics of Operations Research

Band

43(2)

Seiten / Artikelnummer

638 - 650

Verlag

Informs

Thema

matroids; online algorithms; Secretary problem

Organisationseinheit

09487 - Zenklusen, Rico / Zenklusen, Rico

Förderung

165866 - New Approaches to Constrained Submodular Maximization (SNF)

Mehr

Alle Metadaten anzeigen

Zitate

7 Zitate in Web of Science

11 Zitate in Scopus

ETH Bibliographie

yes

Altmetrics