The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs