Effective-Resistance-Reducing Flows, Spectrally Thin Trees and Asymmetric TSP
236
Microsoft Research330 тыс
Следующее
Популярные
249 дней – 3 9895:35
08.02.22 – 12844:40Опубликовано 22 июня 2016, 0:02
We show that the integrality gap of the natural LP relaxation of the Asymmetric Traveling Salesman Problem is at most polyloglog(n). In other words, there is a polynomial time algorithm that approximates the value of the optimum tour within a factor of polyloglog(n). To prove this, we show that any k-edge-connected graph (for k=Omega(log(n))) has a polylog(k)/k thin tree. In this talk I will highlight the main ideas of our proof. This is a joint work with Nima Anari.
Свежие видео
5 дней – 7 0582:15
11 дней – 10 7291:00
11 дней – 26812:50
13 дней – 1 5630:45
Случайные видео
169 дней – 246 8780:41
279 дней – 82 02013:17
06.12.22 – 30 8731:00
08.03.21 – 262 1262:07
24.10.19 – 42 71215:09
25 дней – 2311:10
5 дней – 3 6590:15
6 дней – 35 49910:34
6 дней – 60 9960:15
7 дней – 18 0460:22
10 дней – 1 4840:59
10 дней – 9020:59
12 дней – 17 2781:00