Laminar Matroid Secretary: Greedy Strikes Back

Zhiyi Huang, Zahra Parsaeian, Zixuan Zhu

CoRR（2023）

引用 0|浏览0

暂无评分

摘要

We show that a simple greedy algorithm is $4.75$ probability-competitive for the Laminar Matroid Secretary Problem, improving the $3\sqrt{3} \approx 5.17$-competitive algorithm based on the forbidden sets technique (Soto, Turkieltaub, and Verdugo, 2018).

查看译文

关键词

secretary,greedy strikes

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要