The matching polytope has exponential extension complexity
354
29.5
Microsoft Research334 тыс
Следующее
27.06.16 – 3851:07:47Популярные
80 дней – 1 1676:36
Опубликовано 27 июня 2016, 18:01
A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a polynomial. After two decades of standstill, recent years have brought amazing progress in showing lower bounds for the so called extension complexity. However, the central question in this field remained wide open: can the perfect matching polytope be written as an LP with polynomially many constraints? We answer this question negatively. In fact, the extension complexity of the perfect matching polytope in a complete n-node graph is 2 Omega (n).
Свежие видео
2 дня – 5 0360:31
3 дня – 19 5350:31
3 дня – 11512:15
4 дня – 7010:50
4 дня – 1 5481:01Случайные видео
50 дней – 25012:52
158 дней – 85 5957:41
241 день – 15 2680:57
05.11.23 – 286 09016:32
01.09.23 – 232 7657:26
30.11.22 – 8050:44
2 дня – 8 9500:10
8 дней – 2 98038:03
11 дней – 19 78818:00
12 дней – 54 6258:15
12 дней – 1321:23
13 дней – 28 3530:45
14 дней – 6 7670:43
12 часов – 272 3202:18:21