Only recently, progress has been made in obtaining o(log (rank))-competitive algorithms for the matroid secretary problem. More precisely, Chakraborty and Lachish ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback