Pages that link to "Item:Q1290633"
From MaRDI portal
The following pages link to Random sampling and greedy sparsification for matroid optimization problems (Q1290633):
Displayed 4 items.
- Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees (Q293385) (← links)
- Competitive weighted matching in transversal matroids (Q2428661) (← links)
- Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback (Q3386400) (← links)
- Constant-competitiveness for random assignment matroid secretary without knowing the matroid (Q6086020) (← links)