sentence1: as noted by hajiaghayi and jain , the k-forest problem is a lagrangian relaxation of the pcgst problem .
sentence2: hajiaghayi and jain show that the k-forest problem is roughly as hard as the celebrated densest k-subgraph problem .