Video: Fabrizio Grandoni, "Surviving in Directed Graphs: A Quasi-polynomial-time Polylogarithmic Approximation for Two-connected Directed Steiner Tree"

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

Fabrizio Grandoni, IDSIA, University of Lugano

Tuesday, November 14, 2017 11:37 - 12:04

Surviving in Directed Graphs: A Quasi-polynomial-time Polylogarithmic Approximation for Two-connected Directed Steiner Tree

Fabrizio Grandoni, Video: Surviving in Directed Graphs: A Quasi-polynomial-time Polylogarithmic Approximation for Two-connected Directed Steiner Tree

Fabrizio Grandoni, Surviving in Directed Graphs: A Quasi-polynomial-time Polylogarithmic Approximation for Two-connected Directed Steiner Tree, Approximation Algorithms and the Hardness of Approximation, BIRS, BIRS talk, 17w5133, math, mathematics, video

Banff International Research Station

presentation

mpeg4

127M

http://www.birs.ca/events/2017/5-day-workshops/17w5133/videos

http://www.birs.ca/events/2017/5-day-workshops/17w5133/videos/watch/201711141137-Grandoni.html

Surviving in Directed Graphs: A Quasi-polynomial-time Polylogarithmic Approximation for Two-connected Directed Steiner Tree

Fabrizio Grandoni at 17w5133: Approximation Algorithms and the Hardness of Approximation on Tuesday, November 14, 2017

0 seconds of 0 secondsVolume 0%

00:00

Download this video (127M)