Tom McCormick, Video: Strongly Polynomial Algorithms for Some Problems Related to Parametric Global Minimum Cuts

Tom McCormick, Video: Strongly Polynomial Algorithms for Some Problems Related to Parametric Global Minimum Cuts

Tom McCormick, Strongly Polynomial Algorithms for Some Problems Related to Parametric Global Minimum Cuts, The Traveling Salesman Problem: Algorithms & Optimization, BIRS, BIRS talk, 18w5088, math, mathematics, video

Banff International Research Station

Banff International Research Station

presentation

mpeg4

105M

http://www.birs.ca/events/2018/5-day-workshops/18w5088/videos

http://www.birs.ca/events/2018/5-day-workshops/18w5088/videos/watch/201809280939-McCormick.html