Skip to main content
SpringerLink
Log in

Max-Coloring

  • Reference work entry
  • First Online:
Handbook of Combinatorial Optimization

Abstract

The max-coloring problem is a natural generalization of the classical vertex coloring problem. The input is a vertex-weighted graph. The objective is to produce a proper coloring such that the overall weight of color classes is minimized, where the weight of each class is defined to be the maximum weight of vertices in that class.

Max-coloring has received significant attention over the last decade. Approximation algorithms and hardness results are now known for a number of graph classes in both the off-line and online setting. The objective of this chapter is to survey the algorithmic state of the art for the max-coloring problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 3,400.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 549.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. B.S. Baker, E.G. Coffmann Jr., Mutual exclusion scheduling. Theor. Comput. Sci. 162, 225–243 (1996)

    Article  MATH  Google Scholar 

  2. E. Bampis, A. Kononov, G. Lucarelli, I. Milis, Bounded max-colorings of graphs, in Proceedings of the 21st International Symposium on Algorithms and Computation (Springer, 2010), pp. 353–365

    Google Scholar 

  3. H.L. Bodlaender, K. Jansen, Restrictions of graph partition problems. Part I. Theor. Comput. Sci. 148(1), 93–109 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  4. N. Bourgeois, G. Lucarelli, I. Milis, V.Th. Paschos, Approximating the max-edge-coloring problem. Theor. Comput. Sci. 411(34–36), 3055–3067 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. D.G. Corneil, S. Olariu, L. Stewart, The ultimate interval graph recognition algorithm? (extended abstract), in Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SIAM, 1998), pp. 175–180

    Google Scholar 

  6. J. Correa, N. Megow, R. Raman, K. Suchan, Cardinality constrained graph partitioning into cliques with submodular costs, in Proceedings of the 8th Cologne Twente Workshop on Graphs and Combinatorial Optimization (2009), pp. 347–350

    Google Scholar 

  7. D. de Werra, M. Demange, B. Escoffier, J. Monnot, V.Th. Paschos, Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Discret. Appl. Math. 157(4), 819–832 (2009)

    Article  MATH  Google Scholar 

  8. M. Demange, D. de Werra, J. Monnot, V.Th. Paschos, Weighted node coloring: When stable sets are expensive, in Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science (Springer, 2002), pp. 114–125

    Google Scholar 

  9. M. Demange, D. de Werra, J. Monnot, V.Th. Paschos, Time slot scheduling of compatible jobs. J. Sched. 10(2), 111–127 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Z. Dvorak, K.-I. Kawarabayashi, R. Thomas, Three-coloring triangle-free planar graphs in linear time. ACM Trans. Algorithms 7(4), 41 (2011)

    MathSciNet  Google Scholar 

  11. L. Epstein, M. M. Halldorsson, A. Levin, H. Shachnai, Weighted sum coloring in batch scheduling of conflicting jobs. Algorithmica 55(4), 643–665 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. L. Epstein, A. Levin, On the max coloring problem, in Proceedings of the 2th Workshop on Approximation and Online Algorithms (Springer, 2007), pp. 142–155

    Google Scholar 

  13. L. Epstein, M. Levy, Online interval coloring and variants, in Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (Springer, 2005), pp. 602–613

    Google Scholar 

  14. B. Escoffier, J. Monnot, V.Th. Paschos, Weighted coloring: further complexity and approximability results. Inf. Process. Lett. 97(3), 98–103 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  15. F. Gardi, Mutual exclusion scheduling with interval graphs or related classes. Part I. Discret. Appl. Math. 157(1), 19–35 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  16. M.R. Garey, D.S. Johnson, L.J. Stockmeyer, Some simplified np-complete graph problems. Theor. Comput. Sci. 1(3), 237–267 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  17. M.C. Golumbic, Algorithmic graph theory and perfect graphs (Academic, New York, 1980)

    MATH  Google Scholar 

  18. D.J. Guan, X. Zhu, A coloring problem for weighted graphs. Inf. Process. Lett. 61(2), 77–81 (1997)

    Article  MathSciNet  Google Scholar 

  19. M.M. Halldórsson, H. Shachnai, Batch coloring flat graphs and thin, in Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (Springer, 2008), pp. 198–209

    Google Scholar 

  20. I. Holyer, The np-completeness of edge-coloring. SIAM J. Comput. 10(4), 718–720 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  21. K. Jansen, The mutual exclusion scheduling problem for permutation and comparability graphs. Inf. Comput. 180(2), 71–81 (2003)

    Article  MATH  Google Scholar 

  22. T. Kavitha, J. Mestre, Max-coloring paths: Tight bounds and extensions, in Proceedings of the 20th International Symposium Algorithms and Computation (Springer, 2009), pp. 87–96

    Google Scholar 

  23. A. Kesselman, K. Kogan, Nonpreemptive scheduling of optical switches. IEEE Trans. Commun. 55(6), 1212–1219 (2007)

    Article  Google Scholar 

  24. A. Kierstead, W.T. Trotter, An extremal problem in recursive combinatorics. Congr. Numerantium 33, 143–153 (1981)

    MathSciNet  Google Scholar 

  25. J. Kratochvil, Precoloring extensions with a fixed color bound. Acta Math. Univ. Comen. 62, 139–153 (1993)

    MathSciNet  MATH  Google Scholar 

  26. G. Lucarelli, I. Milis, Improved approximation algorithms for the max edge-coloring problem. Inf. Process. Lett. 111(16), 819–823 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  27. N.S. Narayanswamy, R. Subhash Babu, A note on first-fit coloring of interval graphs. Order 25, 49–53 (2008)

    Article  MathSciNet  Google Scholar 

  28. T. Nonner, Clique-clustering yields PTAS for max-coloring interval graphs, in Proceedings of the 38th International Colloquium on Automata, Languages and Programming (Springer, 2011), pp. 183–194

    Google Scholar 

  29. C.H. Papadimitriou, M. Yannakakis, On limited nondeterminism and the complexity of the v-c dimension. J. Comput. Syst. Sci. 53(2), 161–170 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  30. S.V. Pemmaraju, R. Raman, Approximation algorithms for the max-coloring problem, in Proceedings of the 32th International Colloquium on Automata, Languages and Programming (Springer, 2005), pp. 1064–1075

    Google Scholar 

  31. S.V. Pemmaraju, R. Raman, K. Varadarajan, Buffer minimization using max-coloring, in Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SIAM, 2004), pp. 562–571

    Google Scholar 

  32. S.V. Pemmaraju, R. Raman, K. Varadarajan, Max-coloring and online coloring with bandwidths on interval graphs. ACM Trans. Algorithms 7(3) (2011)

    Google Scholar 

  33. C.N. Potts, M.Y. Kovalyov, Scheduling with batching: A review. Eur. J. Oper. Res. 120, 228–249 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  34. R. Raman, Chromatic Scheduling. PhD thesis, University of Iowa, 2007

    Google Scholar 

  35. N. Robertson, D.P. Sanders, P.D. Seymour, R. Thomas, The four-colour theorem. J. Comb. Theory B 70(1), 2–44 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  36. A. Schrijver, Combinatorial Optimization (Springer, Berlin/Heidelberg, 2003)

    MATH  Google Scholar 

  37. S. Vishwanathan, Randomized online graph coloring. J. Algorithms 13(4), 657–669 (1992)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Technologies, The University of Sydney, SIT Building, J12, 2006, Sydney, NSW, Australia

    Julián Mestre

  2. Indraprasta Institute of Information Technology, Delhi, India

    Rajiv Raman

Authors
  1. Julián Mestre
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajiv Raman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Julián Mestre or Rajiv Raman .

Editor information

Editors and Affiliations

  1. Department of Industrial and Systems Eng, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

  2. Department of Computer Science, University of Texas, Dallas, Richardson, Texas, USA

    Ding-Zhu Du

  3. Dept. Comp. Sci. & Engineering, University of California, San Diego, La Jolla, California, USA

    Ronald L. Graham

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this entry

Cite this entry

Mestre, J., Raman, R. (2013). Max-Coloring. In: Pardalos, P., Du, DZ., Graham, R. (eds) Handbook of Combinatorial Optimization. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7997-1_32

Download citation

Publish with us

Policies and ethics

Search

Navigation