Sam Gutekunst, Video: Semidefinite Programming Relaxations of the Traveling Salesman Problem

Sam Gutekunst, Video: Semidefinite Programming Relaxations of the Traveling Salesman Problem

Sam Gutekunst, Semidefinite Programming Relaxations of the Traveling Salesman Problem, Approximation Algorithms and the Hardness of Approximation, BIRS, BIRS talk, 17w5133, math, mathematics, video

Banff International Research Station

Banff International Research Station

presentation

mpeg4

80M

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

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