'E time' diaporamas de présentation

Matroids, Secretary Problems, and Online Mechanisms

Matroids, Secretary Problems, and Online Mechanisms. Nicole Immorlica, Microsoft Research Joint work with Robert Kleinberg and Moshe Babaioff. The Secretary Problem. Company wants to hire a secretary There are n secretaries available, each of whom will accept any offer they receive

339 views • 14 slides

Longest Path in a DAG

Longest Path in a DAG. Algorithm. Compute topological order of vertices: A B C D E F G H I . F. D. 3. 6. E. time. 5. C. H. I. A. B. G. 0. 6. 0. 4. 2. 4. Longest Path in a DAG. Algorithm. Compute topological order of vertices: A B C D E F G H I .

802 views • 12 slides

Relationship

139 views • 4 slides