Parameterized Approximation Algorithms for Bidirected Steiner Network Problems

Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi

The Directed Steiner Network (DSN) problem takes as input a directed edge-weighted graph $G=(V,E)$ and a set $\mathcal{D}\subseteq V\times V$ of $k$ demand pairs. The aim is to com…