Fabrizio Grandoni, Bundit Laekhanukit. Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree. In Hamed Hatami, Pierre McKenzie, Valerie King, editors, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. pages 420-428, ACM, 2017. [doi]
Abstract is missing.