{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:04:27Z","timestamp":1781028267972,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":68,"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\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2402667"],"award-info":[{"award-number":["CCF-2402667"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800925","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"2230-2241","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Polylogarithmic Approximation for Buy-at-Bulk Network Design with Protection"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3035-1699","authenticated-orcid":false,"given":"Chandra","family":"Chekuri","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Siebel School of Computer Science, Champaign, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-7913-8561","authenticated-orcid":false,"given":"Rhea","family":"Jain","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Siebel School of Computer Science, Champaign, USA"}],"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","DOI":"10.1016\/j.orl.2004.05.005"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.32"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743427"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1110.0484"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646143"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.4.2.192"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276725"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.8.3.243"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374403"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743488"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060617"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/bltj.20165"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/090750317"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ESA.2024.41"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/365411.365452"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","unstructured":"Chandra Chekuri and Nitish Korula. 2008. Single-Sink Network Design with Vertex Connectivity Requirements. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science Ramesh Hariharan Madhavan Mukund and V Vinay (Eds.) (Leibniz International Proceedings in Informatics (LIPIcs) Vol. 2). Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik Dagstuhl Germany. 131\u2013142. isbn:978-3-939897-08-8 issn:1868-8969 https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2008.1747 10.4230\/LIPIcs.FSTTCS.2008.1747","DOI":"10.4230\/LIPIcs.FSTTCS.2008.1747"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.CH82"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1361192.1361200"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.63"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1747597.1748059"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(98)00029-7"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818375"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.011"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00056"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451098"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916276"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.09.003"},{"key":"e_1_3_2_1_28_1","volume-title":"Italiano","author":"Grandoni Fabrizio","year":"2006","unstructured":"Fabrizio Grandoni and Giuseppe F. Italiano. 2006. Improved Approximation for Single-Sink Buy-at-Bulk. In Algorithms and Computation, Tetsuo Asano (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 111\u2013120. isbn:978-3-540-49696-0"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380827"},{"key":"e_1_3_2_1_30_1","volume-title":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201910)","author":"Gupta Anupam","unstructured":"Anupam Gupta, Ravishankar Krishnaswamy, and R. Ravi. 2010. Tree Embeddings for Two-Edge-Connected Network Design. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201910). Society for Industrial and Applied Mathematics, USA. 1521\u20131538. isbn:9780898716986"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780597"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2010.02.009"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649689"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451053"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS61266.2024.00121"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/3118750.3118967"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780628"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ESA.2024.67"},{"key":"e_1_3_2_1_39_1","volume-title":"To appear in STOC 2026","author":"Ellis Hershkowitz D","unstructured":"D Ellis Hershkowitz and Richard Z Huang. 2025. Planar Length-Constrained Minimum Spanning Trees. arXiv preprint arXiv:2510.09002, To appear in STOC 2026"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978315.25"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120306"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930170004"},{"key":"e_1_3_2_1_43_1","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"Johnson David S","unstructured":"David S Johnson and Michael R Garey. 1979. Computers and intractability: A guide to the theory of NP-completeness. WH Freeman."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/11758471_22"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9774-5"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1121-2"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.04.013"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/314161.314191"},{"key":"e_1_3_2_1_49_1","volume-title":"Approximation algorithms for network design and orienteering","author":"Korula Nitish John","unstructured":"Nitish John Korula. 2010. Approximation algorithms for network design and orienteering. University of Illinois at Urbana-Champaign."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(01)00069-4"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0930"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1137\/050629665"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2390176.2390177"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3186991"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00366-1"},{"key":"e_1_3_2_1_56_1","volume-title":"Optical Networks: A Practical Perspective","author":"Ramaswami Rajiv","year":"2009","unstructured":"Rajiv Ramaswami, Kumar Sivarajan, and Galen Sasaki. 2009. Optical Networks: A Practical Perspective, 3rd Edition (3rd ed.). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA. isbn:0123740924","edition":"3"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365693"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/11682462_4"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.CH94"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.19.1.156"},{"key":"e_1_3_2_1_61_1","volume-title":"Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms. 619\u2013628","author":"Salman F Sibel","year":"1997","unstructured":"F Sibel Salman, Joseph Cheriyan, R Ravi, and Sairam Subramanian. 1997. Buy-at-bulk network design: Approximating the single-sink edge installation problem. In Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms. 619\u2013628."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511616105"},{"key":"e_1_3_2_1_63_1","volume-title":"Stern and Krishna Bala","author":"Thomas","year":"1999","unstructured":"Thomas E. Stern and Krishna Bala. 1999. Multiwavelength Optical Networks: A Layered Approach. Addison-Wesley Longman Publishing Co., Inc., USA. isbn:020130967X"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47867-1_33"},{"key":"e_1_3_2_1_65_1","volume-title":"International Workshop on Graph-Theoretic Concepts in Computer Science. 375\u2013389","author":"Tragoudas Spyros","year":"1996","unstructured":"Spyros Tragoudas and Yaakov L Varol. 1996. Computing disjoint paths with length constraints. In International Workshop on Graph-Theoretic Concepts in Computer Science. 375\u2013389."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.128"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585122"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.01.051"}],"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.3800925","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800925","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:54:53Z","timestamp":1781027693000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800925"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":68,"alternative-id":["10.1145\/3798129.3800925","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800925","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"}}]}}