On the max-weight edge coloring problem
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...