Moran Feldman, Ola Svensson, Rico Zenklusen. O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. In Piotr Indyk, editor, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015. pages 1189-1201, SIAM, 2015. [doi]
@inproceedings{FeldmanSZ15,
title = {O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem},
author = {Moran Feldman and Ola Svensson and Rico Zenklusen},
year = {2015},
doi = {10.1137/1.9781611973730.79},
url = {http://dx.doi.org/10.1137/1.9781611973730.79},
researchr = {https://researchr.org/publication/FeldmanSZ15},
cites = {0},
citedby = {0},
pages = {1189-1201},
booktitle = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015},
editor = {Piotr Indyk},
publisher = {SIAM},
isbn = {978-1-61197-373-0},
}