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 350-0394, Japan;Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama 350-0394, Japan
Venue:
Theoretical Computer Science
Year:
2009

Citing 7
Cited 3

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
Approximating the maximum 2- and 3-edge-colorable subgraph problems

Discrete Applied Mathematics

Approximating maximum edge 2-coloring in simple graphs

Discrete Applied Mathematics
Approximating maximum edge 2-coloring in simple graphs

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Approximating the maximum 3- and 4-edge-colorable subgraph

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory

Quantified Score

Hi-index	5.23

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 2429~0.828.