Strong Algorithms for the Ordinal Matroid Secretary Problem

Abstract:

A general technique and analysis for the matroid secretary problem is presented and then we show how to achieve a 4-competitive algorithm for the case
of graphic matroids.

Date: Sep 05, 2018 at 14:30 h
Venue: República 701, Sala 33 (3er piso).
Speaker: Abner Turkieltaub
Affiliation: Universidad de Chile
Coordinator: Profesores: Mario B. Andrea J. José V.
More info at:
Event website
Abstract:
PDF

Posted on Sep 3, 2018 in ACGO, Seminars