Improved approximation algorithms for the Max Edge-Coloring problem
The Max Edge-Coloring problem asks for a proper edge-coloring of an edge-weighted graph minimizing the sum of the weights of the heaviest edges in the color classes. In this paper we present a PTAs for trees and a 1.74-approximation algorithm for bipartite graphs: we also adapt the last algorithm to one for general graphs of the same, asymptotically, approximation ratio. (C) 2011 Elsevier B.V. All rights reserved.
approximation algorithms max edge-coloring trees, bipartite and general graphs