Abstract
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 edge in each color class. In this paper we present a PTAS for trees and an 1.74-approximation algorithm for bipartite graphs; we also adapt the last algorithm to one for general graphs of the same, asymptotically, approximation ratio. Up to now, no approximation algorithm of ratio 2 - δ, for any constant δ > 0, was known for general or bipartite graphs, while the complexity of the problem on trees remains an open question. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Lucarelli, G., & Milis, I. (2011). Improved approximation algorithms for the max-edge coloring problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6595 LNCS, pp. 206–216). Springer Verlag. https://doi.org/10.1007/978-3-642-19754-3_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
