Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods

Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden, Berthold Vöcking

Abstract: We investigate online algorithms for maximum (weight) independent set on graph classes with bounded inductive independence number ρ like interval and disk graphs with applications to, e.g., task scheduling, spectrum allocation and admission control. In the online setting, nodes of an unknown graph arrive one by one over time. An online algorithm has to decide whether an arriving node should be included into the independent set.