How to Approximate it? Introduction and Greedy Algorithms - Part 1
3 093
20.2
Microsoft Research330 тыс
Следующее
12.08.16 – 7401:32:01Популярные
13.04.23 – 46157:16
12.12.22 – 2 43036:34Опубликовано 12 августа 2016, 3:33
The lecture starts with an outline of the topics proposed to be covered, followed by an introduction to greedy algorithms illustrated using the set cover problem (logarithmic ratio approximation). The homework assigned was to analyze the greedy method applied to Uncapacitated Facility Location, and the Generalized Steiner Forest problems.
Свежие видео
22 часа – 47524:56
3 дня – 22 07024:29
Случайные видео
197 дней – 16 0670:48
257 дней – 198 47913:33
279 дней – 3045:05
06.03.23 – 49 68626:02
12.01.23 – 1 6231:41
01.03.22 – 27 6406:49
2 дня – 53 3427:02
4 дня – 1 6130:26
10 дней – 1 2540:52
11 дней – 1001:43
12 дней – 496 6010:19
