Greedy Algorithms - Part 2
741
17.6
Microsoft Research330 тыс
Следующее
12.08.16 – 1 8481:15:46Популярные
333 дня – 5351:08:45
355 дней – 4 6923:36Опубликовано 12 августа 2016, 3:20
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.
Свежие видео
14 часов – 5920:26
8 дней – 1 3092:36
12 дней – 5 9970:31
Случайные видео
67 дней – 7 9351:46
125 дней – 3 7470:46
13.05.23 – 4 3450:40
30.11.20 – 2 12343:46
19.09.07 – 9 68459:55
5 дней – 20 1421:59
7 дней – 7 6870:59
8 дней – 94 99521:14
10 дней – 174 3541:05
11 дней – 6 4550:16
13 дней – 1 645 07721:11
14 дней – 42 3460:50