$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm

Fabrizio Grandoni 0001, Bundit Laekhanukit, Shi Li 0001. $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm. SIAM Journal on Computing, 52(on), 2019. [doi]

Abstract

Abstract is missing.