Max Edge Coloring of Trees
Data Structures and Algorithms
2009-01-27 v1
Abstract
We study the weighted generalization of the edge coloring problem where the weight of each color class (matching) equals to the weight of its heaviest edge and the goal is to minimize the sum of the colors' weights. We present a 3/2-approximation algorithm for trees.
Keywords
Cite
@article{arxiv.0901.4002,
title = {Max Edge Coloring of Trees},
author = {Giorgio Lucarelli and Ioannis Milis and Vangelis Th. Paschos},
journal= {arXiv preprint arXiv:0901.4002},
year = {2009}
}
Comments
5 pages, 2 figures