Pages that link to "Item:Q2839176"
From MaRDI portal
The following pages link to Matroid secretary problem in the random-assignment model (Q2839176):
Displaying 17 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)
- Secretary markets with local information (Q2010597) (← links)
- On variants of the matroid secretary problem (Q2017872) (← links)
- Secretary problem: graphs, matroids and greedoids (Q2068844) (← links)
- Formal barriers to simple algorithms for the matroid secretary problem (Q2152122) (← links)
- Generalized laminar matroids (Q2422233) (← links)
- The best-or-worst and the postdoc problems with random number of candidates (Q2424796) (← links)
- Secretary Markets with Local Information (Q3449504) (← links)
- Matroid Secretary Problems (Q4625656) (← links)
- The Submodular Secretary Problem Goes Linear (Q4637502) (← 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)
- Online Contention Resolution Schemes with Applications to Bayesian Selection Problems (Q5856151) (← links)