{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T05:40:08Z","timestamp":1746250808193,"version":"3.40.4"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080154"},{"type":"electronic","value":"9783319080161"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08016-1_9","type":"book-chapter","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T04:18:07Z","timestamp":1401423487000},"page":"94-104","source":"Crossref","is-referenced-by-count":3,"title":["Improved LP-rounding Approximations for the k-Disjoint Restricted Shortest Paths Problem"],"prefix":"10.1007","author":[{"given":"Longkun","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications (1993)","key":"9_CR1"},{"issue":"1","key":"9_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.: TV\u00a0Lakshman. Finding disjoint paths with related path costs. Journal of Combinatorial Optimization\u00a012(1), 83\u201396 (2006)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"9_CR3","first-page":"465","volume":"90","author":"P. Chao","year":"2007","unstructured":"Chao, P., Hong, S.: A new approximation algorithm for computing 2-restricted disjoint paths. IEICE Transactions on Information and Systems\u00a090(2), 465\u2013472 (2007)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"9_CR4","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. Freeman, San Francisco (1979)"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tcs.2011.12.009","volume":"432","author":"L. Guo","year":"2012","unstructured":"Guo, L., Shen, H.: On the complexity of the edge-disjoint min-min problem in planar digraphs. Theoretical Computer Science\u00a0432, 58\u201363 (2012)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00453-012-9656-0","volume":"66","author":"L. Guo","year":"2013","unstructured":"Guo, L., Shen, H.: On finding min-min disjoint paths. Algorithmica\u00a066(3), 641\u2013653 (2013)","journal-title":"Algorithmica"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-38768-5_30","volume-title":"Computing and Combinatorics","author":"L. Guo","year":"2013","unstructured":"Guo, L., Shen, H., Liao, K.: Improved approximation algorithms for computing k disjoint paths subject to two constraints. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol.\u00a07936, pp. 325\u2013336. Springer, Heidelberg (2013)"},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0166-218X(90)90024-7","volume":"26","author":"C.L. Li","year":"1989","unstructured":"Li, C.L., McCormick, T.S., 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":"5","key":"9_CR9","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"D.H. Lorenz","year":"2001","unstructured":"Lorenz, D.H., Raz, D.: A simple efficient approximation scheme for the restricted shortest path problem. Operations Research Letters\u00a028(5), 213\u2013219 (2001)","journal-title":"Operations Research Letters"},{"doi-asserted-by":"crossref","unstructured":"Misra, S., Xue, G., Yang, D.: Polynomial time approximations for multi-path routing with bandwidth and delay constraints. In: INFOCOM 2009, pp. 558\u2013566. IEEE (2009)","key":"9_CR10","DOI":"10.1109\/INFCOM.2009.5061962"},{"doi-asserted-by":"crossref","unstructured":"Orda, A., Sprintson, A.: Efficient algorithms for computing disjoint QoS paths. In: INFOCOM 2004, vol.\u00a01, pp. 727\u2013738. IEEE (2004)","key":"9_CR11","DOI":"10.1109\/INFCOM.2004.1354543"},{"unstructured":"Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons Inc. (1998)","key":"9_CR12"},{"doi-asserted-by":"crossref","unstructured":"Suurballe, J.W.: Disjoint paths in a network. Networks\u00a04(2) (1974)","key":"9_CR13","DOI":"10.1002\/net.3230040204"},{"doi-asserted-by":"crossref","unstructured":"Suurballe, J.W., Tarjan, R.E.: A quick method for finding shortest pairs of disjoint paths. Networks\u00a014(2) (1984)","key":"9_CR14","DOI":"10.1002\/net.3230140209"},{"issue":"1","key":"9_CR15","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"},{"issue":"3","key":"9_CR16","doi-asserted-by":"publisher","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.: Polynomial time approximation algorithms for multi-constrained qos routing. IEEE\/ACM Transactions on Networking\u00a016(3), 656\u2013669 (2008)","journal-title":"IEEE\/ACM Transactions on Networking"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08016-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T05:06:15Z","timestamp":1746248775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08016-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080154","9783319080161"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08016-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}