An $O(\log k)$-Approximation for Directed Steiner Tree in Planar Graphs

Zachary Friggstad, Ramin Mousavi

We present an $O(\log k)$-approximation for both the edge-weighted and node-weighted versions of \DST in planar graphs where $k$ is the number of terminals. We extend our approach…