{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:36:30Z","timestamp":1725892590159},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212031"},{"type":"electronic","value":"9783642212048"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21204-8_32","type":"book-chapter","created":{"date-parts":[[2011,5,28]],"date-time":"2011-05-28T05:15:25Z","timestamp":1306559725000},"page":"300-307","source":"Crossref","is-referenced-by-count":2,"title":["Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs"],"prefix":"10.1007","author":[{"given":"Longkun","family":"Guo","sequence":"first","affiliation":[]},{"given":"Hong","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"32_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TNET.2005.863451","volume":"14","author":"D. Xu","year":"2006","unstructured":"Xu, D., Chen, Y., Xiong, Y., Qiao, C., He, X.: On the complexity of and algorithms for finding the shortest path with a disjoint counterpart. IEEE\/ACM Transactions on Networking\u00a014(1), 147\u2013158 (2006)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Zheng, S., Yang, B., Yang, M., Wang, J.: Finding Minimum-Cost Paths with Minimum Sharability. In: 26th IEEE International Conference on Computer Communications IEEE INFOCOM 2007, pp. 1532\u20131540 (2007)","DOI":"10.1109\/INFCOM.2007.180"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Li, C., Thomas McCormick, S., Simchi-Levi, D.: Finding disjoint paths with different path-costs: Complexity and algorithms. Networks\u00a022(7) (1992)","DOI":"10.1002\/net.3230220705"},{"issue":"1","key":"32_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10878-006-8906-y","volume":"12","author":"R. Bhatia","year":"2006","unstructured":"Bhatia, R., Kodialam, M., Lakshman, T.: Finding disjoint paths with related path costs. Journal of Combinatorial Optimization\u00a012(1), 83\u201396 (2006)","journal-title":"Journal of Combinatorial Optimization"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Suurballe, J.: Disjoint paths in a network. Networks\u00a04(2) (1974)","DOI":"10.1002\/net.3230040204"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Suurballe, J., Tarjan, R.: A quick method for finding shortest pairs of disjoint paths. Networks\u00a014(2) (1984)","DOI":"10.1002\/net.3230140209"},{"issue":"1","key":"32_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0166-218X(90)90024-7","volume":"26","author":"C. Li","year":"1989","unstructured":"Li, C., McCormick, T., Simich-Levi, D.: The complexity of finding two disjoint paths with min-max objective function. Discrete Applied Mathematics\u00a026(1), 105\u2013115 (1989)","journal-title":"Discrete Applied Mathematics"},{"issue":"10-11","key":"32_CR8","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1016\/j.disc.2006.03.019","volume":"306","author":"P. Seymour","year":"2006","unstructured":"Seymour, P.: Disjoint paths in graphs. Discrete Mathematics\u00a0306(10-11), 979\u2013991 (2006)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"32_CR9","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1145\/322203.322207","volume":"27","author":"Y. Shiloach","year":"1980","unstructured":"Shiloach, Y.: A polynomial solution to the undirected two paths problem. Journal of the ACM (JACM)\u00a027(3), 445\u2013456 (1980)","journal-title":"Journal of the ACM (JACM)"},{"issue":"2","key":"32_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem* 1. Theoretical Computer Science\u00a010(2), 111\u2013121 (1980)","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"32_CR11","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0166-218X(01)00294-3","volume":"120","author":"H. Holst van der","year":"2002","unstructured":"van der Holst, H., de Pina, J.: Length-bounded disjoint paths in planar graphs. Discrete Applied Mathematics\u00a0120(1-3), 251\u2013261 (2002)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"32_CR12","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1137\/0405009","volume":"5","author":"G. Ding","year":"1992","unstructured":"Ding, G., Schrijver, A., Seymour, P.: Disjoint Paths in a Planar Graph . SIAM J. Discrete Math.\u00a05(1), 112\u2013116 (1992)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"32_CR13","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1137\/S0097539792224061","volume":"23","author":"A. Schrijver","year":"1994","unstructured":"Schrijver, A.: Finding k disjoint paths in a directed planar graph . SIAM J. Computing\u00a023(4), 780\u2013788 (1994)","journal-title":"SIAM J. Computing"},{"key":"32_CR14","unstructured":"Guo, L., Shen, H.: On Finding Min-Min disjoint paths (manuscript)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21204-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T02:52:58Z","timestamp":1553741578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21204-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212031","9783642212048"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21204-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}