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]
@inproceedings{PrusaW17,
title = {LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP},
author = {Daniel Prusa and Tomás Werner},
year = {2017},
doi = {10.1137/1.9781611974782.89},
url = {http://dx.doi.org/10.1137/1.9781611974782.89},
researchr = {https://researchr.org/publication/PrusaW17},
cites = {0},
citedby = {0},
pages = {1372-1382},
booktitle = {Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19},
editor = {Philip N. Klein},
publisher = {SIAM},
isbn = {978-1-61197-478-2},
}