Moses Charikar Greedy approximation algorithms for finding dense components in a graph. 84-95 http://link.springer.de/link/service/series/0558/bibs/1913/19130084.htm 2000 conf/approx/2000 APPROX db/conf/approx/approx2000.html#Charikar00