Threshold rules for online sample selection

DOI10.1142/S1793830910000929MaRDI QIDQ3084694zbMATH OpenFDO

Authors Eric Bach, Shuchi Chawla, Seeun William Umboh

Publication date 25 March 2011

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830910000929

zbMATH Keywords

hiring problemonline algorithmsample selection

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Recommendations

• Threshold rules for online sample selection
• On-line selection of an acceptable pair
• scientific article; zbMATH DE number 6691960
• Select sets: rank and file
• Online Selection of Alternating Subsequences from a Random Sample

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 3277086 (Why is no real title available?)
• On Finding the Maxima of a Set of Vectors
• On the Average Number of Maxima in a Set of Vectors and Applications
• Optimal oblivious routing in polynomial time
• The Secretary Problem and Its Extensions: A Review

Cited in

(2)

• Threshold rules for online sample selection
• scientific article; zbMATH DE number 2112329 (Why is no real title available?)

This page was built for publication: Threshold rules for online sample selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084694)