A showcase of ÉTS researchers’ publications and other contributions

Constructive algorithms for the partial directed weighted improper coloring problem


Downloads per month over past year

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 : 3.

Gagnon F. 2016 12488 Constructive algorithms for the partial directed.pdf - Published Version
Use licence: All rights reserved to copyright holder.

Download (2MB) | Preview


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.

Item Type: Peer reviewed article published in a journal
Gagnon, François
Affiliation: Génie électrique
Date Deposited: 04 Apr 2016 20:21
Last Modified: 12 Jul 2016 18:27

Actions (login required)

View Item View Item