Greed is good: approximating independent sets in sparse and bounded-degree graphs.

Magns M. Halldrsson, Jaikumar Radhakrishnan

Browse the full STOC paper archive.