Sciweavers

Share
AAIM
2008
Springer

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

8 years 8 months ago
Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
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 24 29 = 0.827586 . . .. This improves on the previous best ratio of 468 575 = 0.813913 . . ..
Zhi-Zhong Chen, Ruka Tanahashi
Added 01 Jun 2010
Updated 01 Jun 2010
Type Conference
Year 2008
Where AAIM
Authors Zhi-Zhong Chen, Ruka Tanahashi
Comments (0)
books