Title of article
Online Bounded Coloring of Permutation and Overlap Graphs
Author/Authors
Demange، نويسنده , , Marc and Di Stefano، نويسنده , , Gabriele and Leroy-Beaulieu، نويسنده , , Benjamin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
6
From page
213
To page
218
Abstract
We consider a track assignment problem in a train depot leading to an online bounded coloring problem on permutation graphs or on overlap graphs. For permutation graphs we study the competitiveness of a First Fit-based algorithm and we show it matches the competitive ratio of the problem. For overlap graphs, even the unbounded case does not admit a constant competitive ratio.
Keywords
online algorithms , Bounded coloring , Permutation graphs , Overlap graphs , First-Fit , competitive analysis
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2008
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454857
Link To Document