arXiv (OAI Expanded)
open access
A 3.1462-Competitive Algorithm for Matroid Secretary
The matroid secretary problem asks an online algorithm to select a high-weight independent set from elements arriving in uniformly random order, with immediate and irrevocable decisions. Singla (2026) recently gave a $4$-competitive algorithm for arbitrary matroids using only the number of elements
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A 3.7321-Competitive Algorithm for Matroid Secretary#1011503
- The Strong Secretary Conjecture is True for Linear Matroids#1034589
- Bottleneck Impact and Segment Slack-Based Position Insertion Heuristics for the Permutation Flowshop Scheduling Problem#626968
- Linearizing Algebraic Matroids#665508
- Linearizing Algebraic Matroids#664008
Record · ID 1160784
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive