Video From 17w5133: Approximation Algorithms and the Hardness of Approximation

Tuesday, November 14, 2017 11:37 - 12:04
Surviving in Directed Graphs: A Quasi-polynomial-time Polylogarithmic Approximation for Two-connected Directed Steiner Tree

Download this video (127M)

Other videos from this workshop