arXiv (All)
open access
Multilevel Dynamic Thinning for Matroid Secretary
In the matroid secretary problem, weighted elements arrive in random order, and an online algorithm must irrevocably accept elements forming a high-weight independent set. Dynamic Thinning is a recent, conceptually simple $3.1462$-competitive algorithm for the matroid secretary problem that maintain
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
- Evaluating Proposed Fairness Models for Face Recognition Algorithms#925689
- Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction#622493
- Scale-robust Auctions#684290
- Scale-robust Auctions#682515
- A Refined Alternating Optimization for Sum Rate Maximization in SIM-Aided Multiuser MISO Systems#1373470
Record · ID 1201280
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