Abstract
In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at most b and of weight equal to the weight of the heaviest vertex/edge in this class. The bounded max-vertex/edge-coloring problems ask for such a coloring minimizing the sum of all color classes’ weights. These problems generalize the well known max-coloring problems by taking into account the number of available resources (colors) in practical applications. In this paper we present complexity results and approximation algorithms for the bounded max-coloring problems on general graphs, bipartite graphs and trees.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N.: A note on the decomposition of graphs into isomorphic matchings. Acta Mathematica Hungarica 42, 221–223 (1983)
Baker, B.S., Coffman Jr., E.G.: Mutual exclusion scheduling. Theoretical Computer Science 162, 225–243 (1996)
Bodlaender, H.L., Jansen, K.: Restrictions of graph partition problems. Part I. Theoretical Computer Science 148, 93–109 (1995)
Bongiovanni, G., Coppersmith, D., Wong, C.K.: An optimum time slot assignment algorithm for an SS/TDMA system with variable number of transponders. IEEE Trans. on Communications 29, 721–726 (1981)
Boudhar, M., Finke, G.: Scheduling on a batch machine with job compatibilities. Belgian Journal of Oper. Res., Statistics and Computer Science 40, 69–80 (2000)
Bourgeois, N., Lucarelli, G., Milis, I., Paschos, V.T.: Approximating the max-edge-coloring problem. Theoretical Computer Science 411, 3055–3067 (2010)
Chvátal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4, 233–235 (1979)
de Werra, D., Demange, M., Escoffier, B., Monnot, J., Paschos, V.T.: Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Discrete Applied Mathematics 157, 819–832 (2009)
de Werra, D., Hertz, A., Kobler, D., Mahadev, N.V.R.: Feasible edge coloring of trees with cardinality constraints. Discrete Mathematics 222, 61–72 (2000)
Demange, M., de Werra, D., Monnot, J., Paschos, V.T.: Time slot scheduling of compatible jobs. Journal of Scheduling 10, 111–127 (2007)
Dror, M., Finke, G., Gravier, S., Kubiak, W.: On the complexity of a restricted list-coloring problem. Discrete Mathematics 195, 103–109 (1999)
Epstein, L., Levin, A.: On the max coloring problem. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 142–155. Springer, Heidelberg (2008)
Escoffier, B., Monnot, J., Paschos, V.T.: Weighted coloring: Further complexity and approximability results. Information Processing Letters 97, 98–103 (2006)
Gardi, F.: Mutual exclusion scheduling with interval graphs or related classes. Part II. Discrete Applied Mathematics 156, 794–812 (2008)
Gravier, S., Kobler, D., Kubiak, W.: Complexity of list coloring problems with a fixed total number of colors. Discrete Applied Mathematics 117, 65–79 (2002)
Holyer, I.: The NP-completeness of edge-coloring. SIAM Journal on Computing 10, 718–720 (1981)
Jarvis, M., Zhou, B.: Bounded vertex coloring of trees. Discrete Mathematics 232, 145–151 (2001)
Kavitha, T., Mestre, J.: Max-coloring paths: Tight bounds and extensions. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 87–96. Springer, Heidelberg (2009)
Kesselman, A., Kogan, K.: Nonpreemptive scheduling of optical switches. IEEE Trans. on Communications 55, 1212–1219 (2007)
Pemmaraju, S.V., Raman, R.: Approximation algorithms for the max-coloring problem. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1064–1075. Springer, Heidelberg (2005)
Pemmaraju, S.V., Raman, R., Varadarajan, K.R.: Buffer minimization using max-coloring. In: SODA 2004, pp. 562–571 (2004)
Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: STOC 2006, pp. 681–690 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bampis, E., Kononov, A., Lucarelli, G., Milis, I. (2010). Bounded Max-colorings of Graphs. In: Cheong, O., Chwa, KY., Park, K. (eds) Algorithms and Computation. ISAAC 2010. Lecture Notes in Computer Science, vol 6506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17517-6_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-17517-6_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17516-9
Online ISBN: 978-3-642-17517-6
eBook Packages: Computer ScienceComputer Science (R0)