As Easy as Rank One: Optimal Algorithms for Matroid Secretary and Single-Sample Matroid Prophet
cs.DS, cs.GT
Submitted: 2026-11-06
Updated: 2026-11-06
Code: https://github.com/TlatoaniHJ/MatroidSecretary
Terminology
Sources
- Stationary Online Contention Resolution Schemes
- The Strong Secretary Conjecture is True for Linear Matroids
- Matroid Secretary via Labeling Schemes
- Graphic Matroid Secretary without the Graph
- A Framework for the Secretary Problem on the Intersection of Matroids
- Improved algorithms and analysis for the laminar matroid secretary problem
- Online Algorithms via Minimax and Posterior Matching
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time