{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:33:02Z","timestamp":1767339182921,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,5,22]]},"DOI":"10.1145\/1060590.1060618","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"183-192","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":63,"title":["Multicommodity flow, well-linked terminals, and routing problems"],"prefix":"10.1145","author":[{"given":"Chandra","family":"Chekuri","sequence":"first","affiliation":[{"name":"Lucent Bell Labs, Murray Hill, NJ"}]},{"given":"Sanjeev","family":"Khanna","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA"}]},{"given":"F. Bruce","family":"Shepherd","sequence":"additional","affiliation":[{"name":"Lucent Bell Labs, Murray Hill, NJ"}]}],"member":"320","published-online":{"date-parts":[[2005,5,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060675"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480191198768"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780557"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060632"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007355"},{"key":"e_1_3_2_1_6_1","first-page":"567","volume-title":"Improved Bounds for All Optical Routing. SODA","author":"Aumann Y.","year":"1995"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794285983"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.25.2.255.12228"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799356265"},{"volume-title":"Proc. of SODA","year":"2003","author":"Chekuri C.","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007383"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.27"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"C. Chekuri M. Mydlarz and F. B. Shepherd. Multicommodity Demand Flow in a Tree and Packing Integer Programs. Submitted. Preliminary version in Proc. of ICALP 2003.  C. Chekuri M. Mydlarz and F. B. Shepherd. Multicommodity Demand Flow in a Tree and Packing Integer Programs. Submitted. Preliminary version in Proc. of ICALP 2003.","DOI":"10.1007\/3-540-45061-0_34"},{"volume-title":"Manuscript","year":"2005","author":"Chuzhoy J.","key":"e_1_3_2_1_14_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007364"},{"volume-title":"Proc. of SODA","year":"2005","author":"Demaine E.","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205048"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060674"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45198-3_4"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"A. Frank. Edge-disjoint paths in planar graphs. J. of Combinatorial Theory Ser. B. No. 2 (1985) 164--178.  A. Frank. Edge-disjoint paths in planar graphs. J. of Combinatorial Theory Ser. B. No. 2 (1985) 164--178.","DOI":"10.1016\/0095-8956(85)90046-2"},{"volume-title":"Springer Verlag","year":"1990","author":"Frank A.","key":"e_1_3_2_1_21_1"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90009-2"},{"volume-title":"Freeman","year":"1979","author":"Garey M. R.","key":"e_1_3_2_1_23_1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/646247.685026"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00066-7"},{"volume-title":"Proc. of SODA","year":"2005","author":"Hajiaghayi M.","key":"e_1_3_2_1_26_1"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777419"},{"volume-title":"New York: Plenum Press","year":"1972","author":"Karp R. M.","key":"e_1_3_2_1_28_1"},{"volume-title":"Proc. of STOC","year":"1993","author":"Klein P.","key":"e_1_3_2_1_29_1"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1579"},{"key":"e_1_3_2_1_31_1","first-page":"52","volume-title":"Tardos. Disjoint Paths in Densely Embedded Graphs. Proc. of FOCS","author":"Kleinberg J. M.","year":"1995"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875508"},{"volume-title":"MIT","year":"1996","author":"Kleinberg J. M.","key":"e_1_3_2_1_33_1"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276867"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"S. G. Kolliopoulos and C. Stein. Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs. Math. Programming series A (99):63--87 2004.  S. G. Kolliopoulos and C. Stein. Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs. Math. Programming series A (99):63--87 2004.","DOI":"10.1007\/s10107-002-0370-6"},{"volume-title":"Proc. of SODA","year":"2002","author":"Kolman P.","key":"e_1_3_2_1_36_1"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(03)00351-X"},{"key":"e_1_3_2_1_38_1","first-page":"146","article-title":"The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits. VLSI-Theory (F. P. Preparata ed.) {Advances in Computing Research, Volume 2}, JAI Press, Greenwich","volume":"129","author":"Kramer M. R.","year":"1984","journal-title":"Connecticut"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.1998.649241"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/sfcs.1994.365733"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1061425.1061430"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(81)80012-3"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167284"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652152"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579324"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.26"},{"volume-title":"Flows and VLSI-Layout. Springer-Verlag","year":"1990","author":"Robertson N.","key":"e_1_3_2_1_48_1"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1994.1073"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(91)90061-N"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215352"},{"volume-title":"Springer-Verlag","year":"2003","author":"Schrijver A.","key":"e_1_3_2_1_52_1"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796366"},{"volume-title":"Proc. of SODA","year":"2004","author":"Varadarajan K.","key":"e_1_3_2_1_54_1"}],"event":{"name":"STOC05: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Baltimore MD USA","acronym":"STOC05"},"container-title":["Proceedings of the thirty-seventh annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1060590.1060618","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T08:27:02Z","timestamp":1673166422000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1060590.1060618"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5,22]]},"references-count":54,"alternative-id":["10.1145\/1060590.1060618","10.1145\/1060590"],"URL":"https:\/\/doi.org\/10.1145\/1060590.1060618","relation":{},"subject":[],"published":{"date-parts":[[2005,5,22]]},"assertion":[{"value":"2005-05-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}