Advertisement

Batch Coloring of Graphs

  • Joan Boyar
  • Leah Epstein
  • Lene M. Favrholdt
  • Kim S. Larsen
  • Asaf Levin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10138)

Abstract

In graph coloring problems, the goal is to assign a positive integer color to each vertex of an input graph such that adjacent vertices do not receive the same color assignment. For classic graph coloring, the goal is to minimize the maximum color used, and for the sum coloring problem, the goal is to minimize the sum of colors assigned to all input vertices. In the offline variant, the entire graph is presented at once, and in online problems, one vertex is presented for coloring at each time, and the only information is the identity of its neighbors among previously known vertices. In batched graph coloring, vertices are presented in k batches, for a fixed integer \(k \ge 2\), such that the vertices of a batch are presented as a set, and must be colored before the vertices of the next batch are presented. This last model is an intermediate model, which bridges between the two extreme scenarios of the online and offline models. We provide several results, including a general result for sum coloring and results for the classic graph coloring problem on restricted graph classes: We show tight bounds for any graph class containing trees as a subclass (e.g., forests, bipartite graphs, planar graphs, and perfect graphs), and a surprising result for interval graphs and \(k=2\), where the value of the (strict and asymptotic) competitive ratio depends on whether the graph is presented with its interval representation or not.

References

  1. 1.
    Balogh, J., Békési, J., Dósa, G., Galambos, G., Tan, Z.: Lower bound for 3-batched bin packing. Discrete Optim. 21, 14–24 (2016)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Balogh, J., Békési, J., Galambos, G., Markót, M.C.: Improved lower bounds for semi-online bin packing problems. Computing 84(1–2), 139–148 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Bar-Noy, A., Bellare, M., Halldorsson, M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inf. Comput. 140, 183–202 (1998)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Borodin, A., Ivan, I., Ye, Y., Zimny, B.: On sum coloring and sum multi-coloring for restricted families of graphs. Theoret. Comput. Sci. 418, 1–13 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Boyar, J., Epstein, L., Favrholdt, L.M., Larsen, K.S., Levin, A.: Batch coloring of graphs. Technical report arXiv:1610.02997 [cs.DS], arXiv (2016)
  6. 6.
    Dósa, G.: Batched bin packing revisited. J. Sched. (2015, in press)Google Scholar
  7. 7.
    Epstein, L.: More on batched bin packing. Oper. Res. Lett. 44, 273–277 (2016)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169–197 (1981)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Gutin, G., Jensen, T., Yeo, A.: Batched bin packing. Discrete Optim. 2, 71–82 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Gyárfás, A., Lehel, J.: On-line and first-fit colorings of graphs. J. Graph Theor. 12, 217–227 (1988)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Gyárfás, A., Lehel, J.: First fit and on-line chromatic number of families of graphs. Ars Combinatoria 29(C), 168–176 (1990)zbMATHMathSciNetGoogle Scholar
  12. 12.
    Halldórsson, M.M.: Online coloring known graphs. Electron. J. Comb. 7 (2000)Google Scholar
  13. 13.
    Halldórsson, M.M., Szegedy, M.: Lower bounds for on-line graph coloring. Theoret. Comput. Sci. 130(1), 163–174 (1994)CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Kierstead, H.A., Smith, D.A., Trotter, W.T.: First-fit coloring on interval graphs has performance ratio at least 5. Eur. J. Comb. 51, 236–254 (2016)CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. Congr. Numer. 33, 143–153 (1981)zbMATHMathSciNetGoogle Scholar
  16. 16.
    Kubicka, E.: The chromatic sum of a graph: history and recent developments. Int. J. Math. Math. Sci. 2004(30), 1563–1573 (2004)CrossRefzbMATHMathSciNetGoogle Scholar
  17. 17.
    Kubicka, E., Schwenk, A.J.: An introduction to chromatic sums. In: 17th ACM Computer Science Conference, pp. 39–45. ACM Press (1989)Google Scholar
  18. 18.
    Narayanaswamy, N.S., Babu, R.S.: A note on first-fit coloring of interval graphs. Order 25(1), 49–53 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  19. 19.
    Nicolosoi, S., Sarrafzadeh, M., Song, X.: On the sum coloring problem on interval graphs. Algorithmica 23(2), 109–126 (1999)CrossRefzbMATHMathSciNetGoogle Scholar
  20. 20.
    Zhang, G., Cai, X., Wong, C.K.: Scheduling two groups of jobs with incomplete information. J. Syst. Sci. Syst. Eng. 12, 73–81 (2003)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Joan Boyar
    • 1
  • Leah Epstein
    • 2
  • Lene M. Favrholdt
    • 1
  • Kim S. Larsen
    • 1
  • Asaf Levin
    • 3
  1. 1.Department of Mathematics and Computer ScienceUniversity of Southern DenmarkOdenseDenmark
  2. 2.Department of MathematicsUniversity of HaifaHaifaIsrael
  3. 3.Faculty of IE&MThe TechnionHaifaIsrael

Personalised recommendations