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 . This improves on the previous best ratio of . © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Chen, Z. Z., & Tanahashi, R. (2008). Approximating maximum edge 2-coloring in simple graphs via local improvement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5034 LNCS, pp. 84–96). https://doi.org/10.1007/978-3-540-68880-8_10
Mendeley helps you to discover research relevant for your work.