The Proportional Coloring Problem: Optimizing Buffers in Radio Mesh Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics, Algorithms and Applications Year : 2012

The Proportional Coloring Problem: Optimizing Buffers in Radio Mesh Networks

Abstract

In this paper, we consider a new edge coloring problem to model call scheduling op- timization issues in wireless mesh networks: the proportional coloring. It consists in finding a minimum cost edge coloring of a graph which preserves the propor- tion given by the weights associated to each of its edges. We show that deciding if a weighted graph admits a proportional coloring is pseudo-polynomial while de- termining its proportional chromatic index is NP-hard. We then give lower and upper bounds for this parameter that can be computed in pseudo-polynomial time. We finally identify a class of graphs and a class of weighted graphs for which the proportional chromatic index can be exactly determined.
Fichier principal
Vignette du fichier
DMAA_Huc_Linhares_Rivano_2011.pdf (190.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00657802 , version 1 (09-01-2012)

Identifiers

  • HAL Id : hal-00657802 , version 1

Cite

Florian Huc, Claudia Linhares Sales, Hervé Rivano. The Proportional Coloring Problem: Optimizing Buffers in Radio Mesh Networks. Discrete Mathematics, Algorithms and Applications, 2012. ⟨hal-00657802⟩
142 View
207 Download

Share

Gmail Facebook X LinkedIn More