Approximating Maximum Edge Coloring in Multigraphs
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Hi-index | 0.00 |
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors available and the aim is to color as many edges as possible. We prove upper and lower bounds on the performance of different classes of algorithms for the problem. Furthermore, we determine the performance of two specific algorithms, {\it First-Fit} and {\it Next-Fit}.