Approximating independent set in perturbed graphs

For the maximum independent set problem, strong inapproximability bounds for worst-case efficient algorithms exist. We give a deterministic algorithm beating these bounds, with polynomial expected running-time for semi-random graphs: an adversary chooses a graph with nn vertices, and then edges are flipped with a probability of εε. Our algorithm guarantees an approximation ratio of O(nε) for sufficiently large εε.