Dial a Ride from k-forest

Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan +1

The k-forest problem is a common generalization of both the k-MST and the dense-$k$-subgraph problems. Formally, given a metric space on $n$ vertices $V$, with $m$ demand pairs $\s…