Article Dans Une Revue Discrete Mathematics, Algorithms and Applications Année : 2010

Improper colouring of weighted grid and hexagonal graphs

Résumé

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.

Fichier principal
Vignette du fichier
weight-finalrev2.pdf (219.03 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

inria-00526530 , version 1 (14-10-2010)

Licence

Identifiants

Citer

Jean-Claude Bermond, Frédéric Havet, Florian Huc, Claudia Linhares Sales. Improper colouring of weighted grid and hexagonal graphs. Discrete Mathematics, Algorithms and Applications, 2010, 2 (3), pp.395-411. ⟨10.1142/S1793830910000747⟩. ⟨inria-00526530⟩
329 Consultations
326 Téléchargements

Altmetric

Partager

  • More