Video: Bundit Laekhanukit, "(Almost) Settling the Complexity of Approximating Parameterized Dominating Set."

Video From 17w5133: Approximation Algorithms and the Hardness of Approximation

Bundit Laekhanukit, Shanghai University of Finance and Economics

Monday, November 13, 2017 16:38 - 17:03

(Almost) Settling the Complexity of Approximating Parameterized Dominating Set.

Bundit Laekhanukit, Video: (Almost) Settling the Complexity of Approximating Parameterized Dominating Set.

Bundit Laekhanukit, (Almost) Settling the Complexity of Approximating Parameterized Dominating Set., Approximation Algorithms and the Hardness of Approximation, BIRS, BIRS talk, 17w5133, math, mathematics, video

Banff International Research Station

presentation

mpeg4

75M

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

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

Download this video (75M)