Pages that link to "Item:Q5219558"
From MaRDI portal
The following pages link to A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem (Q5219558):
Displaying 7 items.
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- The secretary recommendation problem (Q2155898) (← links)
- Strong Algorithms for the Ordinal Matroid Secretary Problem (Q5000649) (← links)
- (Q5091060) (← links)
- Online Contention Resolution Schemes with Applications to Bayesian Selection Problems (Q5856151) (← links)
- Packing returning secretaries (Q6087124) (← links)
- Machine covering in the random-order model (Q6103518) (← links)
