The following pages link to Matroid Secretary Problems (Q4625656):
Displaying 20 items.
- The simulated greedy algorithm for several submodular matroid secretary problems (Q290918) (← links)
- Scheduling In the random-order model (Q1979454) (← links)
- On variants of the matroid secretary problem (Q2017872) (← links)
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- Secretary problem: graphs, matroids and greedoids (Q2068844) (← links)
- Improved online algorithm for fractional knapsack in the random order model (Q2085749) (← links)
- Formal barriers to simple algorithms for the matroid secretary problem (Q2152122) (← links)
- The secretary recommendation problem (Q2155898) (← links)
- Approximate tradeoffs on weighted labeled matroids (Q2341761) (← links)
- New results for the \(k\)-secretary problem (Q2658048) (← links)
- Matroid secretary problem in the random-assignment model (Q2839176) (← links)
- The simulated greedy algorithm for several submodular matroid secretary problems (Q2957909) (← links)
- Secretary Markets with Local Information (Q3449504) (← links)
- A Framework for the Secretary Problem on the Intersection of Matroids (Q5087013) (← links)
- (Q5091060) (← links)
- The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids (Q5208744) (← links)
- (Q5743511) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- Machine covering in the random-order model (Q6103518) (← links)
- Secretary and online matching problems with machine learned advice (Q6108930) (← links)
