Max Edge Coloring of Trees

Details Max Edge Coloring of Trees Max Edge Coloring of Trees

2009-01-26

arxiv.org/abs/0901.4002v1

Computer Science

Data Structures and Algorithms

5 pages, 2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Max Edge Coloring of Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Max Edge Coloring of Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Max Edge Coloring of Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-372063