Only recently, progress has been made in obtaining o(log (rank))-competitive algorithms for the matroid secretary problem. More precisely, Chakraborty and Lachish ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback