Daniel Prusa, Tomás Werner. LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP. In Philip N. Klein, editor, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19. pages 1372-1382, SIAM, 2017. [doi]
Abstract is missing.