| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 435933 | Theoretical Computer Science | 2009 | 11 Pages |
Abstract
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 .
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
