Talk page

Title:
Almost Polynomial Hardness of Node-Disjoint Paths in Grids

Speaker:
Rachit Nimavat

Link:
http://www.birs.ca/events/2017/5-day-workshops/17w5133/videos/watch/201711161532-Nimavat.html

Workshop:
Birs- 17w5133: Approximation Algorithms and the Hardness of Approximation