Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph