3 citations · 3 across the 1 of their papers we have counts for
2 papers
cs.DS2016
Hiring Secretaries over Time: The Benefit of Concurrent Employment
Yann Disser, John Fearnley, Martin Gairing +5
We consider a stochastic online problem where applicants arrive over time, one per time step. Upon arrival of each applicant their cost per time step is revealed, and we have t…
cs.DS2013★ 3 cited
Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
Oliver Göbel, Martin Hoefer, Thomas Kesselheim +2
We investigate online algorithms for maximum (weight) independent set on graph classes with bounded inductive independence number like, e.g., interval and disk graphs with applicat…