scientific article; zbMATH DE number 7204585

DOI10.4230/LIPIcs.ICALP.2017.133zbMath1442.68277arXiv1702.01290MaRDI QIDQ5111465

Martin Hoefer, Bojana Kodric

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1702.01290

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

online algorithmssecretary problemordinal informationmatroid secretary

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Decision theory (91B06) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Online algorithms; streaming algorithms (68W27)

Related Items (9)

Formal barriers to simple algorithms for the matroid secretary problem ⋮ The secretary recommendation problem ⋮ New results for the \(k\)-secretary problem ⋮ Ordinal approximation for social choice, matching, and facility location problems given candidate positions ⋮ Packing returning secretaries ⋮ Knapsack secretary through boosting ⋮ Secretary markets with local information ⋮ Unnamed Item ⋮ Strong Algorithms for the Ordinal Matroid Secretary Problem

This page was built for publication: