Breaking the Multicommodity Flow Barrier for ?log(n)-Approximations to Sparsest Cut
641
35.6
Microsoft Research334 тыс
Следующее
17.08.16 – 1081:01:37Популярные
43 дня – 28 7363:25
214 дней – 6353:07:51Опубликовано 17 августа 2016, 21:25
We present an algorithm for the sparsest cut problem that simultaneously achieves the better approximation factor of SDP/multicommodity-flow based algorithms and the subquadratic running time of single-commodity flow based algorithms. The idea is that we can turn Arora, Rao, and Vazirani's matching-chaining argument into an algorithm for finding good augmenting paths in a multicommodity flow network. Our analysis follows ARV's, making essential use of measure concentration on the sphere.
Свежие видео
1 день – 91 52837:37
2 дня – 4 09721:06
7 дней – 2 7380:57
9 дней – 66 07615:27
10 дней – 3 0872:04
10 дней – 5 6250:52Случайные видео
69 дней – 593 56122:39
328 дней – 974 0503:23:13
21.07.23 – 11 4440:57
21.07.23 – 8 3110:58
24.03.23 – 347 1241:50
09.01.20 – 85 0676:13
2 дня – 1671:26
4 дня – 1 253 98513:48
5 дней – 1 33038:12
9 дней – 15 5210:27
10 дней – 4002:03
10 дней – 2 9280:41
11 дней – 934 8260:15