45 search results - page 1 / 9 » An Improved Approximation Algorithm for Maximum Edge 2-Color... |
104
Voted
AAIM
2007
Springer
15 years 9 months ago
2007
Springer
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...
116
Voted
AAIM
2008
Springer
15 years 9 months ago
2008
Springer
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 ...
136
Voted
AAIM
2010
Springer
15 years 6 months ago
2010
Springer
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...
140
Voted
ALGORITHMICA
2008
15 years 2 months ago
2008
We show efficient algorithms for edge-coloring planar graphs. Our main result is a linear-time algorithm for coloring planar graphs with maximum degree with max{, 9} colors. Thus...
140
Voted
CATS
2006
15 years 4 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...