{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:40:04Z","timestamp":1757310004348,"version":"3.40.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,5,18]],"date-time":"2012-05-18T00:00:00Z","timestamp":1337299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s00453-012-9656-0","type":"journal-article","created":{"date-parts":[[2012,5,17]],"date-time":"2012-05-17T19:57:59Z","timestamp":1337284679000},"page":"641-653","source":"Crossref","is-referenced-by-count":13,"title":["On Finding Min-Min Disjoint Paths"],"prefix":"10.1007","volume":"66","author":[{"given":"Longkun","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,18]]},"reference":[{"issue":"1","key":"9656_CR1","doi-asserted-by":"crossref","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 Trans. Netw. 14(1), 147\u2013158 (2006)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"9656_CR2","doi-asserted-by":"crossref","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. J. Comb. Optim. 12(1), 83\u201396 (2006)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"9656_CR3","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1109\/TNET.2005.845540","volume":"13","author":"E. Bouillet","year":"2005","unstructured":"Bouillet, E., Labourdette, J., Ramamurthy, R., Chaudhuri, S.: Lightpath re-optimization in mesh optical networks. IEEE\/ACM Trans. Netw. 13(2), 437\u2013447 (2005)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"7","key":"9656_CR4","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1002\/net.3230220705","volume":"22","author":"C.-L. Li","year":"1992","unstructured":"Li, C.-L., McCormick, S.T., Simchi-Levi, D.: Finding disjoint paths with different path-costs: complexity and algorithms. Networks 22(7), 653\u2013667 (1992)","journal-title":"Networks"},{"key":"9656_CR5","doi-asserted-by":"crossref","first-page":"1532","DOI":"10.1109\/INFCOM.2007.180","volume-title":"IEEE INFOCOM 2007, 26th IEEE International Conference on Computer Communications","author":"S. Zheng","year":"2007","unstructured":"Zheng, S., Yang, B., Yang, M., Wang, J.: Finding minimum-cost paths with minimum sharability. In: IEEE INFOCOM 2007, 26th IEEE International Conference on Computer Communications, pp. 1532\u20131540 (2007)"},{"issue":"10\u201311","key":"9656_CR6","doi-asserted-by":"crossref","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 Math. 306(10\u201311), 979\u2013991 (2006)","journal-title":"Discrete Math."},{"key":"9656_CR7","volume-title":"Proceedings of IEEE INFOCOM 2001, Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, vol.\u00a02","author":"G. Liu","year":"2001","unstructured":"Liu, G., Ramakrishnan, K.: A* Prune: an algorithm for finding K shortest paths subject to multiple constraints. In: Proceedings of IEEE INFOCOM 2001, Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, vol.\u00a02 (2001)"},{"issue":"3","key":"9656_CR8","doi-asserted-by":"crossref","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. J. ACM 27(3), 445\u2013456 (1980)","journal-title":"J. ACM"},{"issue":"2","key":"9656_CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230040204","volume":"4","author":"J. Suurballe","year":"1974","unstructured":"Suurballe, J.: Disjoint paths in a network. Networks 4(2), 125\u2013145 (1974)","journal-title":"Networks"},{"issue":"2","key":"9656_CR10","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"J. Suurballe","year":"1984","unstructured":"Suurballe, J., Tarjan, R.: A quick method for finding shortest pairs of disjoint paths. Networks 14(2), 325\u2013336 (1984)","journal-title":"Networks"},{"key":"9656_CR11","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1109\/ISCC.1997.616037","volume-title":"Proceedings of Second IEEE Symposium on Computers and Communications, 1997","author":"R. Bhandari","year":"1997","unstructured":"Bhandari, R.: Optimal physical diversity algorithms and survivable networks. In: Proceedings of Second IEEE Symposium on Computers and Communications, 1997, pp. 433\u2013441 (1997)"},{"issue":"1","key":"9656_CR12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0166-218X(90)90024-7","volume":"26","author":"C.-L. Li","year":"1989","unstructured":"Li, C.-L., McCormick, S.T., Simich-Levi, D.: The complexity of finding two disjoint paths with min-max objective function. Discrete Appl. Math. 26(1), 105\u2013115 (1989)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"9656_CR13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.3233\/HSN-2001-208","volume":"10","author":"A. Sen","year":"2001","unstructured":"Sen, A.: Survivability of lightwave networks\u2013path lengths in WDM protection scheme. J. High Speed Netw. 10(4), 303\u2013315 (2001)","journal-title":"J. High Speed Netw."},{"issue":"1\u20133","key":"9656_CR14","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0166-218X(01)00294-3","volume":"120","author":"H. Holst van\u00a0der","year":"2002","unstructured":"van\u00a0der Holst, H., de Pina, J.: Length-bounded disjoint paths in planar graphs. Discrete Appl. Math. 120(1\u20133), 251\u2013261 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"9656_CR15","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/0095-8956(85)90046-2","volume":"39","author":"A. Frank","year":"1985","unstructured":"Frank, A.: Edge-disjoint paths in planar graphs. J. Comb. Theory, Ser. B 39(2), 164\u2013178 (1985)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9656_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322047.322048","volume":"25","author":"Y. Perl","year":"1978","unstructured":"Perl, Y., Shiloach, Y.: Finding two disjoint paths between two pairs of vertices in a graph. J. Assoc. Comput. Mach. 25, 1 (1978)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9656_CR17","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1007\/978-3-642-21204-8_32","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"L. Guo","year":"2011","unstructured":"Guo, L., Shen, H.: Hardness of finding two edge-disjoint min-min paths in digraphs. In: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, pp. 300\u2013307 (2011)"},{"issue":"3","key":"9656_CR18","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. Garey","year":"1976","unstructured":"Garey, M., Johnson, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1(3), 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"9656_CR19","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9656-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-012-9656-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9656-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:56:55Z","timestamp":1743145015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9656-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,18]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9656"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9656-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2012,5,18]]}}}