{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:04:41Z","timestamp":1781028281699,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["551896423"],"award-info":[{"award-number":["551896423"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Swiss National Science Foundation","award":["200021-200731\/1"],"award-info":[{"award-number":["200021-200731\/1"]}]},{"name":"Swiss National Science Foundation","award":["200021-236706"],"award-info":[{"award-number":["200021-236706"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800912","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"2083-2093","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Approximation Algorithms for Non-preemptive Throughput Maximization"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-6826-398X","authenticated-orcid":false,"given":"Alexander","family":"Armbruster","sequence":"first","affiliation":[{"name":"TU Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9676-4931","authenticated-orcid":false,"given":"Fabrizio","family":"Grandoni","sequence":"additional","affiliation":[{"name":"IDSIA, USI-SUPSI, Lugano, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-7321-5457","authenticated-orcid":false,"given":"Antoine","family":"Tinguely","sequence":"additional","affiliation":[{"name":"IDSIA, USI-SUPSI, Lugano, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7814-8775","authenticated-orcid":false,"given":"Andreas","family":"Wiese","sequence":"additional","affiliation":[{"name":"TU Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","unstructured":"Alessandro Agnetis Jean-Charles Billaut Michael Pinedo and Dvir Shabtay. 2025. Fifty years of research in scheduling\u2013theory and applications. European Journal of Operational Research https:\/\/doi.org\/10.1016\/j.ejor.2025.01.034 10.1016\/j.ejor.2025.01.034","DOI":"10.1016\/j.ejor.2025.01.034"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210337"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","unstructured":"A. Anagnostopoulos F. Grandoni S. Leonardi and A. Wiese. 2014. A Mazing 2+\u03b5 Approximation for Unsplittable Flow on a Path. In SODA. 26\u201341. https:\/\/doi.org\/10.1145\/3242769 10.1145\/3242769","DOI":"10.1145\/3242769"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2017.31"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-93112-3_3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585146"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","unstructured":"N. Bansal A. Chakrabarti A. Epstein and B. Schieber. 2006. A quasi-PTAS for unsplittable flow on line graphs. In STOC. 721\u2013729. https:\/\/doi.org\/10.1145\/1132516.1132617 10.1145\/1132516.1132617","DOI":"10.1145\/1132516.1132617"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"N. Bansal Z. Friggstad R. Khandekar and R. Salavatipour. 2009. A logarithmic approximation for unsplittable flow on line graphs. In SODA. 702\u2013709. https:\/\/doi.org\/10.1145\/2532645 10.1145\/2532645","DOI":"10.1145\/2532645"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/130911317"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/502102.502107"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799354138"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","unstructured":"J. Batra N. Garg A. Kumar T. M\u00f6mke and A. Wiese. 2015. New Approximation Schemes for Unsplittable Flow on a Path. In SODA. 47\u201358. https:\/\/doi.org\/10.1137\/1.9781611973730.5 10.1137\/1.9781611973730.5","DOI":"10.1137\/1.9781611973730.5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009822211065"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04363-9"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/120868360"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69516-5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","unstructured":"V. T. Chakaravarthy A. R. Choudhury S. Gupta S. Roy and Y. Sabharwal. 2014. Improved Algorithms for Resource Allocation under Varying Capacity. In ESA. 222\u2013234. https:\/\/doi.org\/10.1007\/978-3-662-44777-2_19 10.1007\/978-3-662-44777-2_19","DOI":"10.1007\/978-3-662-44777-2_19"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-1210-5"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797327180"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1086819"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959909"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1060.0218"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.6.849"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206029"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0210018"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20532"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28684-6_2"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2021.49"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","unstructured":"F. Grandoni T. M\u00f6mke and A. Wiese. 2022. A PTAS for unsplittable flow on a path. In STOC. ACM 289\u2013302. https:\/\/doi.org\/10.1145\/3519935.3519959 10.1145\/3519935.3519959","DOI":"10.1145\/3519935.3519959"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.39"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.159"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","unstructured":"F. Grandoni T. M\u00f6mke A. Wiese and H. Zhou. 2018. A (5\/3 + \u220a )-approximation for unsplittable flow on a path: placing small tasks into boxes. In STOC. 607\u2013619. https:\/\/doi.org\/10.1145\/3188745.3188894 10.1145\/3188745.3188894","DOI":"10.1145\/3188745.3188894"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)90385-9"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/7531.7535"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0300-x"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59250-3_24"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1148438"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.72"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/090749451"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2019.1036"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02248588"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3833"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/983603"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-05921-6"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.03.006"},{"key":"e_1_3_2_1_47_1","volume-title":"Combinatorial optimization: polyhedra and efficiency. 24","author":"Schrijver Alexander","unstructured":"Alexander Schrijver. 2003. Combinatorial optimization: polyhedra and efficiency. 24, Springer."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<215::AID-JOS27>3.0.CO;2-Y"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/365411.365535"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800912","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:54:24Z","timestamp":1781027664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800912"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":50,"alternative-id":["10.1145\/3798129.3800912","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800912","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}