19 search results - page 1 / 4 » Approximating Maximum Edge 2-Coloring in Simple Graphs Via L... |
AAIM
2008
Springer
13 years 11 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 ...
AAIM
2007
Springer
13 years 10 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...
AAIM
2010
Springer
13 years 7 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...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
COMBINATORICA
2010
12 years 11 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...