{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T21:59:17Z","timestamp":1790805557428,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"European Research Council (ERC)","award":["757481, 805241"],"award-info":[{"award-number":["757481, 805241"]}]},{"name":"Dutch Science Foundation (NWO)","award":["016.Vidi.189.087"],"award-info":[{"award-number":["016.Vidi.189.087"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649764","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"1561-1572","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5577-5012","authenticated-orcid":false,"given":"Daniel","family":"Dadush","sequence":"first","affiliation":[{"name":"Centrum Wiskunde & Informatica, Amsterdam, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4450-8506","authenticated-orcid":false,"given":"Zhuan Khye","family":"Koh","sequence":"additional","affiliation":[{"name":"Centrum Wiskunde & Informatica, Amsterdam, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8068-3280","authenticated-orcid":false,"given":"Bento","family":"Natura","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8897-5459","authenticated-orcid":false,"given":"Neil","family":"Olver","sequence":"additional","affiliation":[{"name":"London School of Economics and Political Science, London, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1152-200X","authenticated-orcid":false,"given":"L\u00e1szl\u00f3 A.","family":"V\u00e9gh","sequence":"additional","affiliation":[{"name":"London School of Economics and Political Science, London, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1287\/OPRE.39.6.955"},{"key":"e_1_3_2_1_2_1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja Ravindra K","year":"1993","unstructured":"Ravindra K Ahuja, Thomas L Magnanti, and James B Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1142132"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00032"},{"key":"e_1_3_2_1_5_1","unstructured":"Xavier Allamigeon Daniel Dadush Georg Loho Bento Natura and L\u00e1szl\u00f3 A V\u00e9gh. 2024. Interior point methods are not worse than Simplex. arxiv:2206.08810v3."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519997"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789812792839_0013"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/focs57990.2023.00037"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00064"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791256325"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/bf01582579"},{"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.1007\/s10107-023-01956-2"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2022.1326"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/focs46700.2020.00091"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374441"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.6028\/jres.071B.033"},{"key":"e_1_3_2_1_18_1","first-page":"303","article-title":"Networks, frames, blocking systems. Mathematics of the Decision Sciences, Part I","volume":"2","author":"Fulkerson DR","year":"1968","unstructured":"DR Fulkerson. 1968. Networks, frames, blocking systems. Mathematics of the Decision Sciences, Part I, Lectures in Applied Mathematics, 2 (1968), 303\u2013334.","journal-title":"Lectures in Applied Mathematics"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00125"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.16.2.351"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.22.4.793"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/s0167-6377(03)00074-9"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793251876"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451058"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.4.366"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.8"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(80)90061-0"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/070693461"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/focs.2014.52"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212022"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580074"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623401388926"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623402416803"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(92)90006-X"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055439"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/s0304-3975(03)00403-1"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0183-8"},{"key":"e_1_3_2_1_40_1","volume-title":"Combinatorial Mathematics and Its Applications: Proceedings North Carolina Conference","author":"Rockafellar R. Tyrrell","year":"1969","unstructured":"R. Tyrrell Rockafellar. 1969. The elementary vectors of a subspace of R^N. In Combinatorial Mathematics and Its Applications: Proceedings North Carolina Conference, Chapel Hill, 1967. The University of North Carolina Press, 104\u2013127."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03025291"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579369"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.2.250"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69346-7_24"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63499"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.16"},{"key":"e_1_3_2_1_47_1","volume-title":"Aaron Sidford, and Zhao Song.","author":"van den Brand Jan","year":"2020","unstructured":"Jan van den Brand, Yin Tat Lee, Aaron Sidford, and Zhao Song. 2020. Solving tall dense linear programs in nearly linear time. arxiv:2002.02304."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Jan van den Brand and Daniel Zhang. 2023. Faster high accuracy multi-commodity flow from single-commodity techniques. arxiv:2304.12992.","DOI":"10.1109\/FOCS57990.2023.00036"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592148"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2016.0800"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.27.3.445.313"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.19.1.53"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-023-02002-x"}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","location":"Vancouver BC Canada","acronym":"STOC '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649764","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649764","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:52Z","timestamp":1750291432000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649764"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":53,"alternative-id":["10.1145\/3618260.3649764","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649764","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}