A simple O(log log(rank))-competitive algorithm for the matroid secretary problem
Year of publication: |
May 2018
|
---|---|
Authors: | Feldman, Moran ; Svensson, Ola Nils Anders ; Zenklusen, Rico |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 43.2018, 2, p. 638-650
|
Subject: | matroids | online algorithms | secretary problem | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Suchtheorie | Search theory |
-
Strong algorithms for the ordinal matroid secretary problem
Soto, José A., (2021)
-
Technical note: on hiring secretaries with stochastic departures
Kesselheim, Thomas, (2024)
-
Optimal replenishment under price uncertainty
Mohr, Esther, (2017)
- More ...
-
No small linear program approximates vertex cover within a factor 2 - ɛ
Bazzi, Abbas, (2019)
-
Minimizing the sum of weighted completion times in a concurrent open shop
Mastrolilli, Monaldo, (2010)
-
Frequency capping in online advertising
Buchbinder, Niv, (2014)
- More ...