O(log 2 k/ log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019.
Directed Steiner Tree Quasi-Polynomial Time Sherali-Adams Hierarchy
In the Directed Steiner Tree (DST) problem we are given an n-vertex directed edge-weighted graph, a root r , and a collection of k terminal nodes. Our goal is to find a minimum-cost subgraph that contains a directed path from r to every terminal. We present an O(log^2 k /log log k )-approximation algorithm for DST that runs in quasi-polyn...More
Full Text (Upload PDF)
PPT (Upload PPT)