| Article Details | ||
|---|---|---|
| Title: | Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree | |
| Article URLs: | ||
| Alternative Article URLs: | ||
| Authors: | Fabrizio Grandoni |
|
| Bundit Laekhanukit |
|
|
| Sharing: | Unknown | |
| Verification: | Authors have not verified information | |
| Artifact Evaluation Badge: | none | |
| Artifact URLs: |
|
|
| Artifact Correspondence Email Addresses: |
|
|
| NSF Award Numbers: | ||
| DBLP Key: | conf/stoc/GrandoniL17 | |
| Author Comments: | ||