


default search action
"Surviving in directed graphs: a quasi-polynomial-time polylogarithmic ..."
Fabrizio Grandoni, Bundit Laekhanukit (2017)
- Fabrizio Grandoni
, Bundit Laekhanukit
:
Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree. STOC 2017: 420-428

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.