A Note on Online Colouring Problems in Overlap Graphs and Their Complements

We consider online versions of different colouring problems in interval overlap graphs, motivated by stacking problems. An instance is a system of time intervals presented in non-decreasing order of the left endpoints. We consider the usual colouring problem as well as b-bounded colouring and the same problems in the complement graph. We also consider the case where at most b intervals of the same colour can include the same element. For these versions, we obtain a logarithmic competitive ratio with respect to the maximum ratio of interval lengths. The best known ratio for the usual colouring was linear, and to our knowledge other variants have not been considered. Moreover, pre-processing allows us to deduce approximation results in the offline case. Our method is based on a partition of the overlap graph into permutation graphs, leading to a competitive-preserving reduction of the problem in overlap graphs to the same problem in permutation graphs. This new partition problem by itself is of interest for future work.

[1]  Gabriele Di Stefano,et al.  Track assignment , 2007, J. Discrete Algorithms.

[2]  Fanica Gavril,et al.  Algorithms for a maximum clique and a maximum independent set of a circle graph , 1973, Networks.

[3]  Martin Olsen,et al.  Probabilistic Analysis of Online Stacking Algorithms , 2015, ICCL.

[4]  Joseph Y.-T. Leung,et al.  Efficient algorithms for interval graphs and circular-arc graphs , 1982, Networks.

[5]  Gabriele Di Stefano,et al.  On the online track assignment problem , 2012, Discret. Appl. Math..

[6]  Marco E. Lübbecke,et al.  Sorting with Complete Networks of Stacks , 2008, ISAAC.

[7]  Charis Papadopoulos,et al.  On the performance of the first-fit coloring algorithm on permutation graphs , 2000, Inf. Process. Lett..

[8]  Walter Unger,et al.  On the k-Colouring of Circle-Graphs , 1988, STACS.

[9]  Mordecai Avriel,et al.  Container ship stowage problem: complexity and connection to the coloring of circle graphs , 2000, Discret. Appl. Math..

[10]  Dominique de Werra,et al.  On Split-Coloring Problems , 2005, J. Comb. Optim..

[11]  Jakub Cerný,et al.  Coloring circle graphs , 2007, Electron. Notes Discret. Math..

[12]  Klaus Jansen,et al.  The mutual exclusion scheduling problem for permutation and comparability graphs , 1998, Inf. Comput..

[13]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[14]  Lorna Stewart,et al.  Approximating the minimum clique cover and other hard problems in subtree filament graphs , 2006, Discret. Appl. Math..