Art gallery theorems and algorithms
Art gallery theorems and algorithms
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Complexity of recognizing equal unions in families of sets
Journal of Algorithms
Approximating Maximum Edge Coloring in Multigraphs
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Journal of Graph Theory
Hi-index | 0.00 |
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of $\frac{468}{575}$. This improves on the previous best (trivial) ratio of $\frac{4}{5}$.