{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:10:37Z","timestamp":1750306237646,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1318242, CCF-1616584"],"award-info":[{"award-number":["CCF-1318242, CCF-1616584"]}],"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":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055411","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"86-99","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["New hardness results for routing on disjoint paths"],"prefix":"10.1145","author":[{"given":"Julia","family":"Chuzhoy","sequence":"first","affiliation":[{"name":"Toyota Technological Institute at Chicago, USA"}]},{"given":"David H. K.","family":"Kim","sequence":"additional","affiliation":[{"name":"University of Chicago, USA"}]},{"given":"Rachit","family":"Nimavat","sequence":"additional","affiliation":[{"name":"Toyota Technological Institute at Chicago, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.33"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-010-2455-9"},{"key":"e_1_3_2_2_3_1","unstructured":"Matthew Andrews and Lisa Zhang. 2005.  Matthew Andrews and Lisa Zhang. 2005."},{"key":"e_1_3_2_2_4_1","unstructured":"Hardness of the undirected edgedisjoint paths problem. In STOC. ACM 276\u2013283.  Hardness of the undirected edgedisjoint paths problem. In STOC. ACM 276\u2013283."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/313651.313820"},{"key":"e_1_3_2_2_8_1","unstructured":"Chandra Chekuri and Julia Chuzhoy. 2016. Half-Integral All-or-Nothing Flow. (2016).  Chandra Chekuri and Julia Chuzhoy. 2016. Half-Integral All-or-Nothing Flow. (2016)."},{"key":"e_1_3_2_2_9_1","unstructured":"Personal Communication.  Personal Communication."},{"key":"e_1_3_2_2_10_1","unstructured":"Chandra Chekuri and Alina Ene. 2013.  Chandra Chekuri and Alina Ene. 2013."},{"volume-title":"Approximation for Maximum Node Disjoint Paths with Constant Congestion. In Proc. of ACM-SIAM SODA.","key":"e_1_3_2_2_11_1"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.27"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060618"},{"key":"e_1_3_2_2_14_1","unstructured":"Chandra Chekuri Sanjeev Khanna and F. Bruce Shepherd. 2006.  Chandra Chekuri Sanjeev Khanna and F. Bruce Shepherd. 2006."},{"key":"e_1_3_2_2_15_1","unstructured":"An O( \u221a n) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow. Theory of Computing 2 1 (2006) 137\u2013146.  An O( \u221a n) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow. Theory of Computing 2 1 (2006) 137\u2013146."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/130910464"},{"key":"e_1_3_2_2_17_1","volume-title":"APPROX\/RANDOM 2015","volume":"40","author":"Chuzhoy Julia","year":"2015"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897538"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2893472"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205048"},{"key":"e_1_3_2_2_21_1","unstructured":"R. Karp. 1972.  R. Karp. 1972."},{"volume-title":"Complexity of Computer Computations","author":"Reducibility","key":"e_1_3_2_2_22_1"},{"key":"e_1_3_2_2_23_1","unstructured":"Ken-Ichi Kawarabayashi and Yusuke Kobayashi. 2013.  Ken-Ichi Kawarabayashi and Yusuke Kobayashi. 2013."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2438645.2438648"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.18"},{"volume-title":"Proceedings of the 36th Annual Symposium on Foundations of Computer Science. 52\u201361","author":"Jon","key":"e_1_3_2_2_26_1"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1579"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0370-6"},{"key":"e_1_3_2_2_29_1","unstructured":"MR Kramer and Jan van Leeuwen. 1984. The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits. Advances in computing research 2 (1984) 129\u2013146.  MR Kramer and Jan van Leeuwen. 1984. The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits. Advances in computing research 2 (1984) 129\u2013146."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1061425.1061430"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652152"},{"key":"e_1_3_2_2_32_1","unstructured":"Prabhakar Raghavan and Clark D. Tompson. 1987.  Prabhakar Raghavan and Clark D. Tompson. 1987."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579324"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/1958016.1958023"},{"key":"e_1_3_2_2_35_1","unstructured":"N. Robertson and P. D. Seymour. 1990. Outline of a disjoint paths algorithm. In Paths Flows and VLSI-Layout. Springer-Verlag.  N. Robertson and P. D. Seymour. 1990. Outline of a disjoint paths algorithm. In Paths Flows and VLSI-Layout. Springer-Verlag."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1006"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.30"}],"event":{"name":"STOC '17: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Montreal Canada","acronym":"STOC '17"},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055411","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055411","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055411","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:27Z","timestamp":1750220607000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055411"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":37,"alternative-id":["10.1145\/3055399.3055411","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055411","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}