Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree.

Fabrizio Grandoni, Bundit Laekhanukit

Browse the full STOC paper archive.