TechFest Workshop - Theory Day - Session 3
244
Microsoft Research330 тыс
Следующее
11.08.16 – 7057:15Популярные
200 дней – 57646:03
306 дней – 23927:12Опубликовано 11 августа 2016, 7:42
Ravishankar Krishnaswamy - Online Algorithms for Multicommodity Buy-At-Bulk Network Design We present the first non-trivial online algorithms for the classical multi-commodity buy-at-bulk problem. -The goal is to provision a low-cost network over time to support bandwidth demands that also arrive over time. Previously, online algorithms were known only for the special cases of all links having the same cost (Awerbuch and Azar, FOCS 1997), or when all demands share the same destination (Meyerson, SPAA 2004).. At the crux of our algorithm is a generic online reduction for a class of network design problems from multi-commodity demands to single-commodity instances. (Joint work with Deeparnab Chakrabarty, Alina Ene and Debmalya Panigrahi.)
Свежие видео
8 дней – 7724:17
9 дней – 411 9451:38
10 дней – 1 266 8490:39
11 дней – 1 0800:59
11 дней – 240 4083:46Случайные видео
45 дней – 6 0320:35
195 дней – 29 28112:41
18.04.23 – 6 1642:18
07.08.22 – 78 86614:43
18.10.21 – 8 0450:59
06.05.13 – 28 4081:47
6 дней – 1823:43
9 дней – 29 91929:28
10 дней – 432 90953:18
12 дней – 1421:53
13 дней – 14 0910:10
15 дней – 135 37211:17