Output details
11 - Computer Science and Informatics
Birkbeck College
Return to search
Output 0 of 0 in the submission
Output title
Improved Competitive Ratio for the Matroid Secretary Problem
Type
E - Conference contribution
DOI
-
Name of conference/published proceedings
Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms
Volume number
-
Issue number
-
First page of article
1702
ISSN of proceedings
-
Year of publication
2012
Number of additional authors
1
Additional information
<12> The Matroid Secretary Problem was first formalized in a 2007 SODA seminal paper by Babioff et al. where a conjecture was made regarding its solution. This paper is the first breakthrough since 2007 with respect to the results of Babioff et al. The reviews for the paper wrote: "Tens of researchers have seriously thought about this problem/conjecture", "Given that this problem has been subject to a lot of effort in recent years, I think this is a great result" and "the paper appears to do this in a novel and sophisticated manner".
Interdisciplinary
-
Cross-referral requested
-
Research group
A - Computational Intelligence
Citation count
5
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
