Geodesic
Constructive algorithms for the partial directed weighted improper coloring problem
Journal of Graph Algorithms and Applications, Tome 20 (2016) no. 2, pp. 159-188.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

Given a complete directed graph G with weights on the vertices and on the arcs, a θ-improper k-coloring is an assignment of at most k different colors to the vertices of G such that the weight of every vertex v is greater, by a given factor 1/θ, than the sum of the weights on the arcs (u,v) entering v with the tail u of the same color as v. For a given real number θ and an integer k, the Partial Directed Weigthed Improper Coloring Problem (PDWICP) is to determine the order of the largest induced subgraph G′ of G such that G′ admits a θ-improper k-coloring. This problem is motivated by a practical channel assignment application where the objective is to maximize the number of simultaneously communicating mobiles in a wireless network. We consider three constructive algorithms for the standard vertex coloring problem, and adapt them to the PDWICP. We show that they perform better than today's phone operator systems based on decentralized channel assignment strategies such as fractional frequency reuse. 
@article{JGAA_2016_20_2_a0,
     author = {Alain Hertz and Romain Montagn\'e and Fran\c{c}ois Gagnon},
     title = {Constructive algorithms for the partial directed weighted improper coloring problem},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {159--188},
     publisher = {mathdoc},
     volume = {20},
     number = {2},
     year = {2016},
     doi = {10.7155/jgaa.00389},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00389/}
}
TY  - JOUR
AU  - Alain Hertz
AU  - Romain Montagné
AU  - François Gagnon
TI  - Constructive algorithms for the partial directed weighted improper coloring problem
JO  - Journal of Graph Algorithms and Applications
PY  - 2016
SP  - 159
EP  - 188
VL  - 20
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00389/
DO  - 10.7155/jgaa.00389
LA  - en
ID  - JGAA_2016_20_2_a0
ER  - 
%0 Journal Article
%A Alain Hertz
%A Romain Montagné
%A François Gagnon
%T Constructive algorithms for the partial directed weighted improper coloring problem
%J Journal of Graph Algorithms and Applications
%D 2016
%P 159-188
%V 20
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00389/
%R 10.7155/jgaa.00389
%G en
%F JGAA_2016_20_2_a0
Alain Hertz; Romain Montagné; François Gagnon. Constructive algorithms for the partial directed weighted improper coloring problem. Journal of Graph Algorithms and Applications, Tome 20 (2016) no. 2, pp. 159-188. doi : 10.7155/jgaa.00389. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00389/

Cité par Sources :