A better than “best possible” algorithm to edge color multigraphs
Journal of Algorithms
On the 1.1 edge-coloring of multigraphs
SIAM Journal on Discrete Mathematics
Asymptotics of the chromatic index for multigraphs
Journal of Combinatorial Theory Series B
Improving a family of approximation algorithms to edge color multigraphs
Information Processing Letters
A sublinear bound on the chromatic index of multigraphs
Discrete Mathematics
Approximating Maximum Edge Coloring in Multigraphs
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximating the chromatic index of multigraphs
Journal of Combinatorial Optimization
Contention-free many-to-many communication scheduling for high performance clusters
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
Approximating the maximum 3- and 4-edge-colorable subgraph
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
The edge coloring problem considers the assignment of colors from a minimum number of colors to edges of a graph such that no two edges with the same color are incident to the same node. We give polynomial time algorithms for approximate edge coloring of multigraphs, that is, parallel edges are allowed. The best previous algorithms achieve a fixed constant approximation factor plus a small additive offset. One of our algorithms achieves solution quality opt + &sqrt;9opt/2 and has execution time polynomial in the number of nodes and the logarithm of the maximum edge multiplicity.