Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

FOCS
1995
IEEE

favoriteEmaildiscussreport

63views Theoretical Computer Science» more FOCS 1995»

Improved Algorithms and Analysis for Secretary Problems and Generalizations

14 years 2 months ago

Improved Algorithms and Analysis for Secretary Problems and Generalizations

Download theory.stanford.edu

Miklós Ajtai, Nimrod Megiddo, Orli Waarts

Real-time Traffic

FOCS 1995 | Theoretical Computer Science |

claim paper

Related Content

» Algorithms for Secretary Problems on Graphs and Hypergraphs

» Improved competitive ratio for the matroid secretary problem

» Matroids secretary problems and online mechanisms

» Optimal Online Data Sampling or How to Hire the Best Secretaries

» Adaptive limitedsupply online auctions

» Splitting algorithms for fast relay selection generalizations analysis and a unified view

» Posted prices vs negotiations an asymptotic analysis

» Fast Algorithms for the Generalized FoleySammon Discriminant Analysis

» An Improved Generalized Discriminant Analysis for LargeScale Data Set

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	FOCS
Authors	Miklós Ajtai, Nimrod Megiddo, Orli Waarts

Comments (0)