Approximating Maximum Edge 2-Coloring in Simple Graphs

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 roughly 0.842 and runs in O(n3 m) time, where n (respectively, m) is the number of vertices (respectively, edges) in the input graph. The previously best ratio achieved by a polynomial-time approximation algorithm was 5 6 0.833.

• Type: Conference
• Year: 2010
• Where: AAIM
• Authors: Zhi-Zhong Chen, Sayuri Konno, Yuki Matsushita
• Keywords: AAIM 2010, Algorithms, Approximation Ratio, Polynomial-time Approximation Algorithm, Simple Graph