# Tight Approximation for Variants of Directed Steiner Tree via State-Tree Decomposition and Linear Programming Rounding

Guo Xiangyu
Li Shi
Xian Jiayi

Abstract:

Directed Steiner Tree (DST) is a central problem in combinatorial optimization and theoretical computer science. Recently, Grandoni, Laekhanukit and Li and independently Ghuge and Nagarajan gave quasi-polynomial time $O(\log^2k/\log \log k)$-approximation algorithms for the problem, which is tight under popular complexity assumptions. ...More

Code:

Data: