Constructive algorithms for the partial directed weighted improper coloring problem

Hertz, Alain, Montagné, Romain et Gagnon, François. 2016. « Constructive algorithms for the partial directed weighted improper coloring problem ». Journal of Graph Algorithms and Applications, vol. 20, nº 2. pp. 159-188.
Compte des citations dans Scopus : 4.

Prévisualisation

PDF Gagnon F. 2016 12488 Constructive algorithms for the partial directed.pdf - Version publiée Licence d'utilisation : Tous les droits réservés aux détenteurs du droit d'auteur. Télécharger (2MB) | Prévisualisation

Résumé

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.

Type de document:	Article publié dans une revue, révisé par les pairs
Professeur:	Professeur Gagnon, François
Affiliation:	Génie électrique
Date de dépôt:	04 avr. 2016 20:21
Dernière modification:	12 juill. 2016 18:27
URI:	https://espace2.etsmtl.ca/id/eprint/12488

Actions (Authentification requise)

Dernière vérification avant le dépôt