Laminar Matroid Secretary: Greedy Strikes Back
Abstract
We show that a simple greedy algorithm is 4.75 probability-competitive for the Laminar Matroid Secretary Problem, improving the 33 ≈ 5.196-competitive algorithm based on the forbidden sets technique (Soto, Turkieltaub, and Verdugo, 2018).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.