O(log log Rank) Competitive Ratio for the Matroid Secretary Problem
- Submitting institution
-
Birkbeck College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 123456789
- Type
- E - Conference contribution
- DOI
-
10.1109/FOCS.2014.42
- Title of conference / published proceedings
- 2014 IEEE 55th Annual Symposium on Foundations of Computer Science
- First page
- 326
- Volume
- -
- Issue
- -
- ISSN
- 2371-610X
- Open access status
- Out of scope for open access requirements
- Month of publication
- October
- Year of publication
- 2014
- URL
-
https://ieeexplore.ieee.org/document/6979017
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
0
- Research group(s)
-
1 - Algorithms, Verification and Software
- Citation count
- 25
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper partially resolves an open problem in the area of on-line algorithms, the Matroid Secretary Problem (MSP). The MSP has received significant attention by leading academics. The result in the paper has yet to be superseded. FOCS is a premier conference on theoretical computer science.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -