Abstract : We study a weighted improper colouring problem motivated by a frequency allocation problem. It consists of associating to each vertex a set of p(v) (weight) distinct colours (frequencies), such that the set of vertices having a given colour induces a graph of degree at most k (the case k = 0 corresponds to a proper coloring). The objective is to minimize the number of colors. We propose approximation algorithms to compute such colouring for general graphs. We apply these to obtain good approximation ratio for grid and hexagonal graphs. Furthermore we give exact results for the 2-dimensional grid and the triangular lattice when the weights are all the same.
Contributeur : Jean-Claude Bermond <>
Soumis le : jeudi 14 octobre 2010 - 22:00:00
Dernière modification le : vendredi 3 décembre 2010 - 00:25:25
Document(s) archivé(s) le : jeudi 25 octobre 2012 - 17:16:08