{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:23:40Z","timestamp":1709821420394},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,12,6]],"date-time":"2013-12-06T00:00:00Z","timestamp":1386288000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10878-013-9693-x","type":"journal-article","created":{"date-parts":[[2013,12,5]],"date-time":"2013-12-05T03:43:25Z","timestamp":1386215005000},"page":"153-164","source":"Crossref","is-referenced-by-count":6,"title":["Improved approximation algorithms for computing $$k$$ k disjoint paths subject to two constraints"],"prefix":"10.1007","volume":"29","author":[{"given":"Longkun","family":"Guo","sequence":"first","affiliation":[]},{"given":"Hong","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Kewen","family":"Liao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,6]]},"reference":[{"key":"9693_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Upper Saddle River"},{"issue":"1","key":"9693_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 TV (2006) Finding disjoint paths with related path costs. J Comb Optim 12(1):83\u201396","journal-title":"J Comb Optim"},{"issue":"2","key":"9693_CR3","first-page":"465","volume":"90","author":"P Chao","year":"2007","unstructured":"Chao P, Hong S (2007) A new approximation algorithm for computing 2-restricted disjoint paths. IEICE Trans Inf Syst 90(2):465\u2013472","journal-title":"IEICE Trans Inf Syst"},{"key":"9693_CR4","volume-title":"Computers and intractability","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. Freeman, San Francisco"},{"key":"9693_CR5","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.tcs.2011.12.009","volume":"432","author":"L Guo","year":"2012","unstructured":"Guo L, Shen H (2012) On the complexity of the edge-disjoint min-min problem in planar digraphs. Theor Comput Sci 432:58\u201363","journal-title":"Theor Comput Sci"},{"issue":"3","key":"9693_CR6","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/s00453-012-9656-0","volume":"66","author":"L Guo","year":"2013","unstructured":"Guo L, Shen H (2013) On finding min\u2013min disjoint paths. Algorithmica 66(3):641\u2013653","journal-title":"Algorithmica"},{"key":"9693_CR7","doi-asserted-by":"crossref","unstructured":"Guo L, Shen H (2012) Efficient approximation algorithms for computing k disjoint minimum cost paths with delay constraint. In PDCAT, IEEE, p 627\u2013631","DOI":"10.1109\/PDCAT.2012.69"},{"issue":"1","key":"9693_CR8","first-page":"105","volume":"26","author":"CL Li","year":"1989","unstructured":"Li CL, McCormick TS, Simich-Levi D (1989) The complexity of finding two disjoint paths with min\u2013max objective function. Discret Appl Math 26(1):105\u2013115","journal-title":"Discret Appl Math"},{"issue":"5","key":"9693_CR9","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"DH Lorenz","year":"2001","unstructured":"Lorenz DH, Raz D (2001) A simple efficient approximation scheme for the restricted shortest path problem. Oper Res Lett 28(5):213\u2013219","journal-title":"Oper Res Lett"},{"key":"9693_CR10","doi-asserted-by":"crossref","unstructured":"Orda A, Sprintson A (2004) Efficient algorithms for computing disjoint QoS paths. In IEEE INFOCOM, Citeseer, vol 1, p 727\u2013738","DOI":"10.1109\/INFCOM.2004.1354543"},{"issue":"2","key":"9693_CR11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230040204","volume":"4","author":"JW Suurballe","year":"1974","unstructured":"Suurballe JW (1974) Disjoint paths in a network. Networks 4(2):125","journal-title":"Networks"},{"issue":"2","key":"9693_CR12","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"JW Suurballe","year":"1984","unstructured":"Suurballe JW, Tarjan RE (1984) A quick method for finding shortest pairs of disjoint paths. Networks 14(2):325","journal-title":"Networks"},{"issue":"1","key":"9693_CR13","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 (2006) On the complexity of and algorithms for finding the shortest path with a disjoint counterpart. IEEE\/ACM Trans Netw 14(1):147\u2013158","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"3","key":"9693_CR14","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/TNET.2007.900712","volume":"16","author":"G Xue","year":"2008","unstructured":"Xue G, Zhang W, Tang J, Thulasiraman K (2008) Polynomial time approximation algorithms for multi-constrained qos routing. IEEE\/ACM Trans Netw 16(3):656\u2013669","journal-title":"IEEE\/ACM Trans Netw"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9693-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9693-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9693-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T08:59:13Z","timestamp":1564909153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9693-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,6]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9693"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9693-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,6]]}}}