7 search results - page 2 / 2 » approx 2011 |
120
click to vote
APPROX
2011
Springer
13 years 11 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
100
click to vote
APPROX
2011
Springer
13 years 11 months ago
2011
Springer
We consider the problem of identifying periodic trends in data streams. We say a signal a ∈ Rn is p-periodic if ai = ai+p for all i ∈ [n − p]. Recently, Erg¨un et al. [4] pr...