The following pages link to (Q5743511):
Displayed 12 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- The simulated greedy algorithm for several submodular matroid secretary problems (Q290918) (← links)
- Laminar matroids (Q518194) (← links)
- Matroid prophet inequalities and applications to multi-dimensional mechanism design (Q1735736) (← links)
- On variants of the matroid secretary problem (Q2017872) (← links)
- Generalized laminar matroids (Q2422233) (← links)
- Strong Algorithms for the Ordinal Matroid Secretary Problem (Q5000649) (← links)
- A Framework for the Secretary Problem on the Intersection of Matroids (Q5087013) (← links)
- The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids (Q5208744) (← links)
- A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem (Q5219558) (← links)
- Constant-competitiveness for random assignment matroid secretary without knowing the matroid (Q6086020) (← links)
- Matroid-constrained vertex cover (Q6162073) (← links)