{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:58:21Z","timestamp":1776333501728,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006112","name":"Microsoft Research","doi-asserted-by":"publisher","award":["Microsoft Research Faculty Fellowship"],"award-info":[{"award-number":["Microsoft Research Faculty Fellowship"]}],"id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","award":["Sloan Research Fellowship"],"award-info":[{"award-number":["Sloan Research Fellowship"]}],"id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-1749609,CCF-1740551, DMS-1839116, DMS-2023166"],"award-info":[{"award-number":["CCF-1749609,CCF-1740551, DMS-1839116, DMS-2023166"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000008","name":"David and Lucile Packard Foundation","doi-asserted-by":"publisher","award":["Packard Fellowship"],"award-info":[{"award-number":["Packard Fellowship"]}],"id":[{"id":"10.13039\/100000008","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451056","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"1784-1797","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path"],"prefix":"10.1145","author":[{"given":"Sally","family":"Dong","sequence":"first","affiliation":[{"name":"University of Washington, USA"}]},{"given":"Yin Tat","family":"Lee","sequence":"additional","affiliation":[{"name":"University of Washington, USA \/ Microsoft Research, USA"}]},{"given":"Guanghao","family":"Ye","sequence":"additional","affiliation":[{"name":"University of Washington, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247614"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508028.2505989"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479894278952"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837020"},{"key":"e_1_3_2_1_5_1","volume-title":"A tourist guide through treewidth","author":"Bodlaender Hans L","year":"1994","unstructured":"Hans L Bodlaender. 1994. A tourist guide through treewidth. 1994."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1009"},{"key":"e_1_3_2_1_7_1","volume-title":"y, and Sebastian Ordyniak","author":"Brand Cornelius","year":"2019","unstructured":"Cornelius Brand, Martin Kouteck\\`y, and Sebastian Ordyniak. 2019. Parameterized algorithms for milps with small treedepth. arXiv preprint arXiv:1912.03501, 2019."},{"key":"e_1_3_2_1_8_1","volume-title":"Maximum Flow in Nearly-linear Time on Moderately Dense Graphs. Personal communication","author":"van den Brand Jan","year":"2020","unstructured":"Jan van den Brand, Yin-Tat Lee, Yang P. Liu, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang. 2020. Maximum Flow in Nearly-linear Time on Moderately Dense Graphs. Personal communication, 2020."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-62127-2_20"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39799-8_36"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010016"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316303"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Jana Cslovjecsek Friedrich Eisenbrand Christoph Hunkenschr\u00f6der Lars Rohwedder and Robert Weismantel. 2020. Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time.","DOI":"10.1137\/1.9781611976465.101"},{"key":"e_1_3_2_1_15_1","volume-title":"Maximization of a linear function of variables subject to linear inequalities. Activity analysis of production and allocation, 13","author":"Dantzig George B","year":"1951","unstructured":"George B Dantzig. 1951. Maximization of a linear function of variables subject to linear inequalities. Activity analysis of production and allocation, 13, 1951. Pages 339\u2013347."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718881"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/s0895479897321076"},{"key":"e_1_3_2_1_18_1","volume-title":"Yin Tat Lee, and Guanghao Ye","author":"Dong Sally","year":"2020","unstructured":"Sally Dong, Yin Tat Lee, and Guanghao Ye. 2020. A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path. CoRR, abs\/2011.05365, 2020. arxiv:2011.05365"},{"key":"e_1_3_2_1_19_1","volume-title":"An algorithmic theory of integer programming. arXiv preprint arXiv:1904.01361","author":"Eisenbrand Friedrich","year":"2019","unstructured":"Friedrich Eisenbrand, Christoph Hunkenschr\u00f6der, Kim-Manuel Klein, Martin Kouteck\\'y, Asaf Levin, and Shmuel Onn. 2019. An algorithmic theory of integer programming. arXiv preprint arXiv:1904.01361, 2019."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00019"},{"key":"e_1_3_2_1_21_1","first-page":"3","article-title":"Fully polynomial-time parameterized computations for graphs and matrices of low treewidth","volume":"14","author":"Fomin Fedor V","year":"2018","unstructured":"Fedor V Fomin, Daniel Lokshtanov, Saket Saurabh, Micha\u0142 Pilipczuk, and Marcin Wrochna. 2018. Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. ACM Transactions on Algorithms (TALG), 14, 3, 2018. Pages 1\u201345.","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0710032"},{"key":"e_1_3_2_1_23_1","volume-title":"Oak Ridge National Laboratory","author":"George Alan","year":"1994","unstructured":"Alan George, Joseph Liu, and Esmond Ng. 1994. Computer solution of sparse linear systems. Oak Ridge National Laboratory, 1994."},{"key":"e_1_3_2_1_24_1","volume-title":"The evolution of the minimum degree ordering algorithm. Siam review, 31, 1","author":"George Alan","year":"1989","unstructured":"Alan George and Joseph WH Liu. 1989. The evolution of the minimum degree ordering algorithm. Siam review, 31, 1, 1989. Pages 1\u201319."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746557"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_65"},{"key":"e_1_3_2_1_27_1","volume-title":"Swati Padmanabhan, and Zhao Song.","author":"Jiang Haotian","year":"2020","unstructured":"Haotian Jiang, Tarun Kathuria, Yin Tat Lee, Swati Padmanabhan, and Zhao Song. 2020. A faster interior point method for semidefinite programming. arXiv preprint arXiv:2009.10217, 2020."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384284"},{"key":"e_1_3_2_1_29_1","volume-title":"Faster dynamic matrix inverse for faster lps. arXiv preprint arXiv:2004.07470","author":"Jiang Shunhua","year":"2020","unstructured":"Shunhua Jiang, Zhao Song, Omri Weinstein, and Hengjie Zhang. 2020. Faster dynamic matrix inverse for faster lps. arXiv preprint arXiv:2004.07470, 2020."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808695"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(80)90061-0"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188960"},{"key":"e_1_3_2_1_34_1","volume-title":"Path Finding I: Solving Linear Programs with\\backslash \\~ O (sqrt (rank)) Linear System Solves. arXiv preprint arXiv:1312.6677","author":"Lee Yin Tat","year":"2013","unstructured":"Yin Tat Lee and Aaron Sidford. 2013. Path Finding I: Solving Linear Programs with\\backslash \\~ O (sqrt (rank)) Linear System Solves. arXiv preprint arXiv:1312.6677, 2013."},{"key":"e_1_3_2_1_35_1","volume-title":"Solving Linear Programs with Sqrt(rank) Linear System Solves. CoRR, abs\/1910.08033","author":"Lee Yin Tat","year":"2019","unstructured":"Yin Tat Lee and Aaron Sidford. 2019. Solving Linear Programs with Sqrt(rank) Linear System Solves. CoRR, abs\/1910.08033, 2019. arxiv:1910.08033"},{"key":"e_1_3_2_1_36_1","volume-title":"Solving Empirical Risk Minimization in the Current Matrix Multiplication Time. In Conference on Learning Theory, COLT 2019","author":"Lee Yin Tat","year":"2019","unstructured":"Yin Tat Lee, Zhao Song, and Qiuyi Zhang. 2019. Solving Empirical Risk Minimization in the Current Matrix Multiplication Time. In Conference on Learning Theory, COLT 2019, 25-28 June 2019, Phoenix, AZ, USA. Pages 2140\u20132157. http:\/\/proceedings.mlr.press\/v99\/lee19a.html"},{"key":"e_1_3_2_1_37_1","series-title":"SIAM journal on numerical analysis, 16, 2","volume-title":"Generalized nested dissection","author":"Lipton Richard J","year":"1979","unstructured":"Richard J Lipton, Donald J Rose, and Robert Endre Tarjan. 1979. Generalized nested dissection. SIAM journal on numerical analysis, 16, 2, 1979. Pages 346\u2013358."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384250"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Yurii Nesterov and Arkadii Nemirovskii. 1994. Interior-point polynomial algorithms in convex programming. SIAM.","DOI":"10.1137\/1.9781611970791"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/0801033"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Richard Peng and Santosh Vempala. 2020. Solving Sparse Linear Systems Faster than Matrix Multiplication.","DOI":"10.1137\/1.9781611976465.31"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3509"},{"key":"e_1_3_2_1_43_1","volume-title":"A polynomial-time algorithm, based on Newton's method, for linear programming. Mathematical programming, 40, 1-3","author":"Renegar James","year":"1988","unstructured":"James Renegar. 1988. A polynomial-time algorithm, based on Newton's method, for linear programming. Mathematical programming, 40, 1-3, 1988. Pages 59\u201393."},{"key":"e_1_3_2_1_44_1","volume-title":"Wavelets and signal processing","author":"Rioul Olivier","year":"1991","unstructured":"Olivier Rioul and Martin Vetterli. 1991. Wavelets and signal processing. IEEE signal processing magazine, 8, 4, 1991. Pages 14\u201338."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/356004.356006"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00490.x"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63500"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.16"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"crossref","unstructured":"Jan van den Brand Yin-Tat Lee Danupon Nanongkai Richard Peng Thatchaphol Saranurak Aaron Sidford Zhao Song and Di Wang. 2020. Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs.","DOI":"10.1109\/FOCS46700.2020.00090"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384309"},{"key":"e_1_3_2_1_52_1","unstructured":"Guanghao Ye. 2020. Fast Algorithm for Solving Structured Convex Programs."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619478"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451056","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451056","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:45Z","timestamp":1750197705000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":53,"alternative-id":["10.1145\/3406325.3451056","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451056","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}