We consider the k-Directed Steiner Forest} (k-dsf) problem: given a directed graph G=(V,E) with edge costs, a collection D subseteq V \times V of ordered node pairs, and an integer k leq |D|, find a minimum cost subgraph H of G that contains an st-path for (at least) k pairs ... more >>>