Approximating maximum edge 2-coloring in simple graphs

Authors:
Zhi-Zhong Chen;Sayuri Konno;Yuki Matsushita
Affiliations:
-;-;-
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 9
Cited 0

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
An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems

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
Path factors in cubic graphs

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

Quantified Score

Hi-index	0.05

Visualization

Abstract

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(n^3m) 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 56~0.833.