conference paper
A Simple O (log log(rank)) -Competitive Algorithm for the Matroid Secretary Problem
Indyk, Piotr
2015
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015
Type
conference paper
Author(s)
Editors
Indyk, Piotr
Date Issued
2015
Publisher
Published in
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015
ISBN of the book
978-1-61197-374-7
Start page
1189
End page
1201
Editorial or Peer reviewed
REVIEWED
Written at
OTHER
EPFL units
Available on Infoscience
May 10, 2017
Use this identifier to reference this record