An improved approximation algorithm for maximum edge 2-coloring in simple graphs

Authors:
Zhi-Zhong Chen;Ruka Tanahashi;Lusheng Wang
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;Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong
Venue:
Journal of Discrete Algorithms
Year:
2008

Citing 6
Cited 6

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

Journal of Graph Theory

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

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
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
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	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 468575. This improves on the previous best (trivial) ratio of 45.