O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Moran Feldman' in GoogleThis author has not been identified. Look up 'Ola Svensson' in GoogleThis author has not been identified. Look up 'Rico Zenklusen' in Google

runs on WebDSL