An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs

13 years 10 months ago

Download rnc.r.dendai.ac.jp

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 468 575 . This improves on the previous best (trivial) ratio of 4 5 .

Zhi-Zhong Chen, Ruka Tanahashi

Real-time Traffic

AAIM 2007 | Algorithms | Approximation Ratio | Polynomial-time Approximation Algorithm |

claim paper

» Approximating Maximum Edge 2Coloring in Simple Graphs

» New LinearTime Algorithms for EdgeColoring Planar Graphs

» Graph Orientation Algorithms to Minimize the Maximum Outdegree

» Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One

» Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks

» Improved Approximation Algorithms for the Spanning Star Forest Problem

» Improved Inapproximability Results for Maximum kColorable Subgraph

» Improved Orientations of Physical Networks

Post Info
More Details (n/a)

Added	06 Jun 2010
Updated	06 Jun 2010
Type	Conference
Year	2007
Where	AAIM
Authors	Zhi-Zhong Chen, Ruka Tanahashi

Comments (0)

Sciweavers

An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs

AAIM 2007 | Algorithms | Approximation Ratio | Polynomial-time Approximation Algorithm |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers