A simple O(loglog(rank))-competitive algorithm for the matroid secretary problem

Thumbnail
Metadata only
Author
Feldman, Moran
Svensson, Ola
Zenklusen, Rico
Date
2018-05
Type
  • Journal Article
Publication status
published
External links
Search via SFX
Journal / series
Mathematics of Operations Research
Volume
43(2)
Pages / Article No.
638 - 650
Publisher
Informs
Subject
matroids; online algorithms; Secretary problem
Funding
165866 - New Approaches to Constrained Submodular Maximization (SNF)
More
Show all metadata
Citations
Cited 0 times in Web of Science
ETH Bibliography
yes
Altmetrics