{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:08:26Z","timestamp":1763467706562,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":22,"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.1060632","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"276-283","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["Hardness of the undirected edge-disjoint paths problem"],"prefix":"10.1145","author":[{"given":"Matthew","family":"Andrews","sequence":"first","affiliation":[{"name":"Bell Labs, Murray Hill, NJ"}]},{"given":"Lisa","family":"Zhang","sequence":"additional","affiliation":[{"name":"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.1109\/FOCS.2004.32"},{"key":"e_1_3_2_1_2_1","first-page":"567","volume-title":"Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Aumann Y.","year":"1995","unstructured":"Y. Aumann and Y. Rabani . Improved bounds for all optical routing . In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 567 -- 576 , 1995 .]] Y. Aumann and Y. Rabani. Improved bounds for all optical routing. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 567--576, 1995.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.25.2.255.12228"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Chekuri C.","year":"2003","unstructured":"C. Chekuri and S. Khanna . Edge-disjoint paths revisited . In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms , 2003 .]] C. Chekuri and S. Khanna. Edge-disjoint paths revisited. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003.]]"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007383"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796455"},{"key":"e_1_3_2_1_7_1","first-page":"251","article-title":"Regul\u00e4re graphen gegebener Taillenweite mit minimaler Knotenzahl. Wiss. Z. Uni. Halle-Wittenburg (Math","volume":"12","author":"Erd\u00f6s P.","year":"1963","unstructured":"P. Erd\u00f6s and H. Sachs . Regul\u00e4re graphen gegebener Taillenweite mit minimaler Knotenzahl. Wiss. Z. Uni. Halle-Wittenburg (Math . Nat.) , 12 : 251 -- 257 , 1963 .]] P. Erd\u00f6s and H. Sachs. Regul\u00e4re graphen gegebener Taillenweite mit minimaler Knotenzahl. Wiss. Z. Uni. Halle-Wittenburg (Math. Nat.), 12:251--257, 1963.]]","journal-title":"Nat.)"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226652"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523685"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301262"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875508"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276867"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225075"},{"key":"e_1_3_2_1_15_1","first-page":"52","volume-title":"Proceedings of the 36th Annual Symposium on Foundations of Computer Science","author":"Kleinberg J.","year":"1995","unstructured":"J. Kleinberg and E. Tardos . Disjoint paths in densely embedded graphs . In Proceedings of the 36th Annual Symposium on Foundations of Computer Science , pages 52 -- 61 , 1995 .]] J. Kleinberg and E. Tardos. Disjoint paths in densely embedded graphs. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 52--61, 1995.]]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796365"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69346-7_12"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21958"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1661"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335329"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796366"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380839"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Varadarajan K.","year":"2004","unstructured":"K. Varadarajan and G. Venkataraman . Graph decomposition and a greedy algorithm for edge-disjoint paths . In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms , 2004 .]] K. Varadarajan and G. Venkataraman. Graph decomposition and a greedy algorithm for edge-disjoint paths. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004.]]"}],"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.1060632","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T08:25:15Z","timestamp":1673166315000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1060590.1060632"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5,22]]},"references-count":22,"alternative-id":["10.1145\/1060590.1060632","10.1145\/1060590"],"URL":"https:\/\/doi.org\/10.1145\/1060590.1060632","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"}}]}}