Max Edge Coloring of Trees

Simple item page
dc.creatorLucarelli, Giorgio
dc.creatorMilis, Ioannis
dc.creatorPaschos, Vangelis Th.
dc.date2009-01-26
dc.date.accessioned2026-07-07T12:34:33Z
dc.date.available2026-07-07T12:34:33Z
dc.descriptionWe 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.
dc.description5 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/0901.4002
dc.identifierhttp://arxiv.org/abs/0901.4002
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/217474
dc.subjectData Structures and Algorithms
dc.titleMax Edge Coloring of Trees
dc.typetext

Files

Collections

arXiv