The following pages link to (Q5365115):
Displaying 18 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)
- Online interval scheduling with a bounded number of failures (Q1707823) (← links)
- Secretary markets with local information (Q2010597) (← links)
- On variants of the matroid secretary problem (Q2017872) (← links)
- Worst case compromises in matroids with applications to the allocation of indivisible goods (Q2346382) (← links)
- Generalized laminar matroids (Q2422233) (← links)
- A note on the online interval scheduling secretary problem (Q2670476) (← links)
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) (Q3088096) (← links)
- Secretary Markets with Local Information (Q3449504) (← 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)
- (Q5743511) (← links)
- Matroid-constrained vertex cover (Q6162073) (← links)
