Piotr J. Wojciechowski, K. Subramani, Matthew D. Williamson. Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints. Discrete Applied Mathematics, 305:272-294, 2021. [doi]
@article{WojciechowskiSW21,
title = {Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints},
author = {Piotr J. Wojciechowski and K. Subramani and Matthew D. Williamson},
year = {2021},
doi = {10.1016/j.dam.2020.10.016},
url = {https://doi.org/10.1016/j.dam.2020.10.016},
researchr = {https://researchr.org/publication/WojciechowskiSW21},
cites = {0},
citedby = {0},
journal = {Discrete Applied Mathematics},
volume = {305},
pages = {272-294},
}