Sally Dong, Yin Tat Lee, Guanghao Ye. A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path. In Samir Khuller, Virginia Vassilevska Williams, editors, STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021. pages 1784-1797, ACM, 2021. [doi]
@inproceedings{DongLY21-1,
title = {A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path},
author = {Sally Dong and Yin Tat Lee and Guanghao Ye},
year = {2021},
doi = {10.1145/3406325.3451056},
url = {https://doi.org/10.1145/3406325.3451056},
researchr = {https://researchr.org/publication/DongLY21-1},
cites = {0},
citedby = {0},
pages = {1784-1797},
booktitle = {STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021},
editor = {Samir Khuller and Virginia Vassilevska Williams},
publisher = {ACM},
isbn = {978-1-4503-8053-9},
}