Video: Nicole Megow, "An O(log m)-Competitive Algorithm for Online Machine Minimization"

Video From 15w5118: Approximation Algorithms and Parameterized Complexity

Nicole Megow, Technische Universität München

Wednesday, December 2, 2015 11:45 - 12:16

An O(log m)-Competitive Algorithm for Online Machine Minimization

Nicole Megow, Video: An O(log m)-Competitive Algorithm for Online Machine Minimization

Nicole Megow, An O(log m)-Competitive Algorithm for Online Machine Minimization, Approximation Algorithms and Parameterized Complexity, BIRS, BIRS talk, 15w5118, math, mathematics, video

Banff International Research Station

presentation

mpeg4

101M

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

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

0 seconds of 0 secondsVolume 90%

00:00

This video file cannot be played.(Error Code: 224003)

Download this video (101M)