On the max-weight edge coloring problem

Giorgio Lucarelli (1) , Ioannis Milis (1) , Vangelis Th. Paschos (2)

1 CS-AUEB - Department of Informatics [Athens]
2 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

We study the following generalization of the classical edge coloring problem: Given a weighted graph, find a partition of its edges into matchings (colors), each one of weight equal to the maximum weight of its edges, so that the total weight of the partition is minimized. We explore the frontier between polynomial and NP-hard variants of the problem as well as the approximability of the NP-hard variants.

Mots clés: weighted edge coloring; polynomial algorithms; approximation algorithms

Domaines: Complexité [cs.CC]; Recherche opérationnelle [math.OC]

Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos. On the max-weight edge coloring problem. 2007. ⟨hal-00175853⟩