Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement

Authors:
Zhi-Zhong Chen;Ruka Tanahashi
Affiliations:
Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama, Japan 350-0394;Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama, Japan 350-0394
Venue:
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Year:
2008

Citing 6
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 improved approximation algorithm for maximum edge 2-coloring in simple graphs

Journal of Discrete Algorithms
Path factors in cubic graphs

Journal of Graph Theory

Quantified Score

Hi-index	0.00

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 $\frac{24}{29}=0.827586\ldots$. This improves on the previous best ratio of $\frac{468}{575}=0.813913\ldots$.