Bounded Max-colorings of Graphs

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.

[1]  On the complexity of a restricted list-coloring problem , 1999, Discret. Math..

[2]  Noga Alon,et al.  A note on the decomposition of graphs into isomorphic matchings , 1983 .

[3]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[4]  Edward G. Coffman,et al.  Mutual Exclusion Scheduling , 1996, Theor. Comput. Sci..

[5]  Rajiv Raman,et al.  Buffer minimization using max-coloring , 2004, SODA '04.

[6]  D. de Werra,et al.  Time slot scheduling of compatible jobs , 2007, J. Sched..

[7]  Vangelis Th. Paschos,et al.  Approximating the max-edge-coloring problem , 2010, Theor. Comput. Sci..

[8]  Alain Hertz,et al.  Feasible edge colorings of trees with cardinality constraints , 2000, Discret. Math..

[9]  Frédéric Gardi.  Mutual exclusion scheduling with interval graphs or related classes. Part II , 2008, Discret. Appl. Math..

[10]  Telikepalli Kavitha,et al.  Max-coloring paths: tight bounds and extensions , 2012, J. Comb. Optim..

[11]  Kirill Kogan,et al.  Nonpreemptive Scheduling of Optical Switches , 2007, IEEE Transactions on Communications.

[12]  David Zuckerman.  Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number , 2007, Theory Comput..

[13]  Vangelis Th. Paschos,et al.  Weighted coloring on planar, bipartite and split graphs: Complexity and approximation , 2009, Discret. Appl. Math..

[14]  Gerd Finke,et al.  Batch processing with interval graph compatibilities between tasks , 2005, Discret. Appl. Math..

[15]  Frédéric Gardi.  Mutual exclusion scheduling with interval graphs or related classes, Part I , 2009, Discret. Appl. Math..

[16]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[17]  G. Bongiovanni,et al.  An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders , 1981, IEEE Trans. Commun..

[18]  Vangelis Th. Paschos,et al.  Weighted Coloring: further complexity and approximability results , 2006, Inf. Process. Lett..

[19]  Sylvain Gravier,et al.  Complexity of list coloring problems with a fixed total number of colors , 2002, Discret. Appl. Math..

[20]  Leah Epstein,et al.  On the max coloring problem , 2012, Theor. Comput. Sci..

[21]  Bing Zhou,et al.  Bounded vertex coloring of trees , 2001, Discret. Math..

[22]  Rajiv Raman,et al.  Approximation Algorithms for the Max-coloring Problem , 2005, ICALP.

[23]  Vangelis Th. Paschos,et al.  Weighted Coloring: Further Complexity and Approximability Results , 2005, ICTCS.

[24]  Klaus Jansen,et al.  Restrictions of Graph Partition Problems. Part I , 1995, Theor. Comput. Sci..