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 . . ..

• Type: Conference
• Year: 2008
• Where: AAIM
• Authors: Zhi-Zhong Chen, Ruka Tanahashi
• Keywords: AAIM 2008, Algorithms, Approximation Ratio, Polynomial-time Approximation Algorithm