Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh. A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. In Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath 0001, Julia Chuzhoy, editors, Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020. pages 761-774, ACM, 2020. [doi]
@inproceedings{DadushHNV20,
title = {A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix},
author = {Daniel Dadush and Sophie Huiberts and Bento Natura and László A. Végh},
year = {2020},
doi = {10.1145/3357713.3384326},
url = {https://doi.org/10.1145/3357713.3384326},
researchr = {https://researchr.org/publication/DadushHNV20},
cites = {0},
citedby = {0},
pages = {761-774},
booktitle = {Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020},
editor = {Konstantin Makarychev and Yury Makarychev and Madhur Tulsiani and Gautam Kamath 0001 and Julia Chuzhoy},
publisher = {ACM},
isbn = {978-1-4503-6979-4},
}