Second, we give a greedy approximation algorithm for the densest subgraph with a specified subset problem. We show that the greedy algorithm is of approximation ratio $2\\cdot (1+ \\frac{k}{3})$, where $k$ is the element number of the specified subset. 展开 ...