Metric Rounding of LP Relaxations
723
17.2
Microsoft Research329 тыс
Следующее
12.08.16 – 2 3341:28Популярные
196 дней – 9215:33Опубликовано 12 августа 2016, 4:03
LP relaxations interpreted as metrics (or distance functions in graphs) are useful in designing approximation algorithms for cut problems. This was illustrated by designing an exact algorithm for minimum s-t cut, a 2-approximation for multiway cut in graphs, a 2-approximation for the multicut problem in trees and finally a logarithmic approximation for the multicut problem in general graphs.
Свежие видео
10 часов – 8 27934:54
2 дня – 7 6470:16
3 дня – 119 6655:32
5 дней – 3 5460:23
5 дней – 3 3800:20
6 дней – 81 52910:29Случайные видео
209 дней – 34 1380:31
347 дней – 219 2800:40
11.10.22 – 7581:20
22.02.22 – 49 4486:27
19.10.19 – 130 8973:49
22.03.11 – 5 1953:05
5 дней – 46 39523:14
5 дней – 5820:42
5 дней – 634 3390:59
5 дней – 2 58840:22
7 дней – 56 03817:16
8 дней – 112 3791:54
13 дней – 12 0600:58