1 paper
Tetsuya Araki, Koji M. Kobayashi
Kierstead and Trotter (Congressus Numerantium 33, 1981) proved that their algorithm is an optimal online algorithm for the online interval coloring problem. In this paper, for onli…