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

Thursday, November 16, 2017 15:32 - 16:01
Almost Polynomial Hardness of Node-Disjoint Paths in Grids
Rachit Nimavat, Video: Almost Polynomial Hardness of Node-Disjoint Paths in Grids
Rachit Nimavat, Video: Almost Polynomial Hardness of Node-Disjoint Paths in Grids
Rachit Nimavat, Almost Polynomial Hardness of Node-Disjoint Paths in Grids, Approximation Algorithms and the Hardness of Approximation, BIRS, BIRS talk, 17w5133, math, mathematics, video
Banff International Research Station
Banff International Research Station
presentation
mpeg4
76M
http://www.birs.ca/events/2017/5-day-workshops/17w5133/videos
0 seconds of 0 secondsVolume 90%
Press shift question mark to access a list of keyboard shortcuts
00:00
00:00
00:00
 
This video file cannot be played.(Error Code: 224003)

Download this video (76M)



Other videos from this workshop