An \(O(\log k)\)-Approximation for Directed Steiner Tree in Planar GraphsPublished in ACM Transactions on Algorithms, 2024Share on Bluesky Facebook LinkedIn Mastodon X (formerly Twitter) Previous Next