Klaus Jansen, Video: Lower bounds on the running time for packing and scheduling problems

Klaus Jansen, Video: Lower bounds on the running time for packing and scheduling problems

Klaus Jansen, Lower bounds on the running time for packing and scheduling problems, Approximation Algorithms and Parameterized Complexity, BIRS, BIRS talk, 15w5118, math, mathematics, video

Banff International Research Station

Banff International Research Station

presentation

mpeg4

88M

http://www.birs.ca/events/2015/5-day-workshops/15w5118/videos

http://www.birs.ca/events/2015/5-day-workshops/15w5118/videos/watch/201512020932-Jansen.html