Abstract
Given a vertex-weighted graph G = (V,E;w), w(v) ≥ 0 for any v ∈ V, we consider a weighted version of the coloring problem which consists in finding a partition \({\mathcal S}=(S_{1}...,S_{k})\) of the vertex set V of G into stable sets and minimizing ∑ i = 1 k w(S i ) where the weight of S is defined as max{w(v) : v ∈ S}. In this paper, we keep on with the investigation of the complexity and the approximability of this problem by mainly answering one of the questions raised by D. J. Guan and X. Zhu (”A Coloring Problem for Weighted Graphs”, Inf. Process. Lett. 61(2):77-81 1997).
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
Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam (1973)
Boudhar, M., Finke, G.: Scheduling on a batch machine with job compatibilities. Special issue ORBEL-14: Emerging challenges in operations research (Mons, 2000). Belg. J. Oper. Res. Statist. Comput. Sci. 40(1-2), 69–80 (2000)
de Werra, D., Demange, M., Escoffier, B., Monnot, J., Paschos, V.T.: Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 896–907. Springer, Heidelberg (2004)
de Werra, D., Demange, M., Monnot, J., Paschos, V.T.: Weighted node coloring: when stable sets are expensive. In: Kučera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 114–125. Springer, Heidelberg (2002)
Finke, G., Jost, V., Queyranne, M., Sebö, A., Zhu, X.: Batch Processing With Interval Graph Compatibilities Between Tasks. Cahiers du laboratoire Leibniz, 108 (2004) available at http://www-leibniz.imag.fr/NEWLEIBNIZ/LesCahiers/index.xhtml
Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.H.: The complexity of coloring circular arcs and chords. SIAM J. Algebraic Dicrete Methods 1, 216–222 (1980)
Garey, M.R., Johnson, D.S.: Computers and intractability. a guide to the theory of NP-completeness. Freeman, CA (1979)
Guan, D.J., Zhu, X.: A Coloring Problem for Weighted Graphs. Inf. Process. Lett. 61(2), 77–81 (1997)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)
Grotzsch, H.: Ein dreifarbensatz fur dreikreisfreie netze auf der kugel, Wiss. Z. Martin Luther Univ. Halle-Wittenberg, Math. Naturwiss Reihe 8, 109-120 (1959)
Jansen, K., Scheffler, P.: Generalized coloring for tree-like graphs. Discrete Applied Mathematics 75, 135–155 (1997)
König, D.: Ber graphen und iher anwendung auf determinantentheorie und mengenlehre. Math. Ann. 77, 453–465 (1916)
Kratochvl, J., Tuza, Z.: Algorithmic complexity of list colorings. Discrete Applied Mathematics 50(3), 297–302 (1994)
Pemmaraju, S.V., Raman, R., Varadarajan, K.R.: Buffer minimization using max-coloring. In: SODA, pp. 562–571 (2004)
Pemmaraju, S.V., Raman, R.: Approximation algorithms for the max-coloring. In: ICALP (2005) (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Escoffier, B., Monnot, J., Paschos, V.T. (2005). Weighted Coloring: Further Complexity and Approximability Results. In: Coppo, M., Lodi, E., Pinna, G.M. (eds) Theoretical Computer Science. ICTCS 2005. Lecture Notes in Computer Science, vol 3701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560586_17
Download citation
DOI: https://doi.org/10.1007/11560586_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29106-0
Online ISBN: 978-3-540-32024-1
eBook Packages: Computer ScienceComputer Science (R0)