Abstract
A version of weighted coloring of a graph is introduced: each node υ of a graph G = (V,E) is provided with a positive integer weight w(υ) and the weight of a stable set S of G is w(S) = maxw(υ) : υ ∈ V ∩ S. A k-coloring S = (S 1, . . . , S k) of G is a partition of V into k stable sets S 1, . . . , S k and the weight of S is w(S 1) + . . . + w(S k ). The objective then is to find a coloring S = (S 1, . . . , S k ) of G such that w(S 1) + . . . + w(S k ) is minimized. Weighted node coloring is NP-hard for general graphs (as generalization of the node coloring problem). We prove here that the associated decision problems are NP-complete for bipartite graphs, for line-graphs of bipartite graphs and for split graphs. We present approximation results for general graphs. For the other families of graphs dealt, properties of optimal solutions are discussed and complexity and approximability results are presented.
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
Demange, M., de Werra, D., Monnot, J., Paschos, V.T.: Time slot scheduling of compatible jobs. Cahier du LAMSADE 182, LAMSADE, Universit Paris-Dauphine (2001) Available on www address: http://www.lamsade.dauphine.fr/cahdoc.html#cahiers.
Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: a review. European J. Oper. Res. 120 (2000) 228–249
Potts, C.N., Strusevich, V.A., Tautenhahn, T.: Scheduling batches with simultaneous job processing for two-machine shop problems. J. of Scheduling 4 (2001) 25–51
Boudhar, M., Finke, G.: Scheduling on a batch machine with job compatibilities. JORBEL (2001) To appear.
Berge, C.: Graphs and hypergraphs. North Holland, Amsterdam (1973)
de Werra, D.: Heuristics for graph coloring. Computing 7 (1990) 191–208
Simon, H.U.: On approximate solutions for combinatorial optimization problems. SIAM J. Disc. Math. 3 (1990) 294–310
Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. System Sci. 9 (1974) 256–278
Alfandari, L., Paschos, V.T.: Master-slave strategy and polynomial approximation. Comput. Opti. Appl. 16 (2000) 231–245
Boppana, B.B., Halldórsson, M.M.: Approximating maximum independent sets by excluding subgraphs. BIT 32 (1992) 180–196
Bodlaender, H.L., Jansen, K., Woeginger, G.J.: Scheduling with incompatible jobs. Discrete Appl. Math. 55 (1994) 219–232
de Werra, D., Erschler, J.: Open shop scheduling with some additional constraints. Graphs and Combinatorics 12 (1996) 81–93
Rendl, F.: On the complexity of decomposing matrices arising in satellite communication. Oper. Res. Lett. 4 (1985) 5–8
König, D.: ber graphen und iher anwendung auf determinantentheorie und mengenlehre. Math. Ann. 77 (1916) 453–465
Chvtal, V.: Perfectly ordered graphs. In Berge, C., Chvtal, V., eds.: Topics on Perfect Graphs. (Volume 21 of Annals of Discrete Math.) 253–277
Jansen, K., Scheffler, P.: Generalized coloring for tree-like graphs. Discrete Appl. Math. 75 (1997) 135–155
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demange, M., Werra, D.d., Monnot, J., Paschos, V.T. (2002). Weighted Node Coloring: When Stable Sets Are Expensive. In: Goos, G., Hartmanis, J., van Leeuwen, J., Kučera, L. (eds) Graph-Theoretic Concepts in Computer Science. WG 2002. Lecture Notes in Computer Science, vol 2573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36379-3_11
Download citation
DOI: https://doi.org/10.1007/3-540-36379-3_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00331-1
Online ISBN: 978-3-540-36379-8
eBook Packages: Springer Book Archive