论文信息 - Online Bounded Coloring of Permutation and Overlap Graphs

Online Bounded Coloring of Permutation and Overlap Graphs

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.

Gabriele Di Stefano | Marc Demange | Benjamin Leroy-Beaulieu

[1] V. Chvátal. Perfectly Ordered Graphs , 1984 .

[2] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[3] Gabriele Di Stefano,et al. A Graph Theoretical Approach To The Shunting Problem , 2004, Electron. Notes Theor. Comput. Sci..

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

[5] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.

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

[7] Alan Bundy,et al. Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

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