A simple O(loglog(rank))-competitive algorithm for the matroid secretary problem
Metadata only
Date
2018-05Type
- Journal Article
Citations
Cited 7 times in
Web of Science
Cited 11 times in
Scopus
ETH Bibliography
yes
Altmetrics
Publication status
publishedExternal links
Journal / series
Mathematics of Operations ResearchVolume
Pages / Article No.
Publisher
InformsSubject
matroids; online algorithms; Secretary problemOrganisational unit
09487 - Zenklusen, Rico / Zenklusen, Rico
Funding
165866 - New Approaches to Constrained Submodular Maximization (SNF)
More
Show all metadata
Citations
Cited 7 times in
Web of Science
Cited 11 times in
Scopus
ETH Bibliography
yes
Altmetrics