Matroid Secretary Problems
From MaRDI portal
Publication:4625656
DOI10.1145/3212512zbMath1425.68461OpenAlexW2808107677MaRDI QIDQ4625656
Moshe Babaioff, David Kempe, Nicole Immorlica, Robert D. Kleinberg
Publication date: 25 February 2019
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3212512
Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Online algorithms; streaming algorithms (68W27)
Related Items (17)
Secretary Markets with Local Information ⋮ Formal barriers to simple algorithms for the matroid secretary problem ⋮ The secretary recommendation problem ⋮ New results for the \(k\)-secretary problem ⋮ A Framework for the Secretary Problem on the Intersection of Matroids ⋮ Constant-competitiveness for random assignment matroid secretary without knowing the matroid ⋮ Machine covering in the random-order model ⋮ Secretary and online matching problems with machine learned advice ⋮ Knapsack secretary through boosting ⋮ Improved Online Algorithms for Knapsack and GAP in the Random Order Model ⋮ Scheduling In the random-order model ⋮ Unnamed Item ⋮ Improved online algorithms for Knapsack and GAP in the random order model ⋮ The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids ⋮ Secretary problem: graphs, matroids and greedoids ⋮ Improved online algorithm for fractional knapsack in the random order model ⋮ Unnamed Item
This page was built for publication: Matroid Secretary Problems
