From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs

Chandra Chekuri, Rhea Jain, Shubhang Kulkarni +2

In the Directed Steiner Tree (DST) problem the input is a directed edge-weighted graph $G=(V,E)$, a root vertex $r$ and a set $S\subseteq V$ of $k$ terminals. The goal is to find…