Max Edge Coloring of Trees

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
5 pages, 2 figures

Keywords

Data Structures and Algorithms

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/217474

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0901.4002
 http://arxiv.org/abs/0901.4002

Collections

arXiv