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
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
An improved approximation algorithm for maximum edge 2-coloring in simple graphs
Journal of Discrete Algorithms
Journal of Graph Theory
Approximating maximum edge 2-coloring in simple graphs via local improvement
Theoretical Computer Science
Approximating the maximum 2- and 3-edge-colorable subgraph problems
Discrete Applied Mathematics
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 roughly 0.842 and runs in O(n3m) time, where n (respectively, m) is the number of vertices (respectively, edges) in the input graph. The previously best ratio achieved by a polynomial-time approximation algorithm was 5/6 ≈ 0.833.