Top-k overlapping densest subgraphs: Approximation and complexity