{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:42:07Z","timestamp":1787506927782,"version":"build-2736575974"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,9,17]],"date-time":"2014-09-17T00:00:00Z","timestamp":1410912000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s00224-014-9569-1","type":"journal-article","created":{"date-parts":[[2014,9,16]],"date-time":"2014-09-16T02:07:48Z","timestamp":1410833268000},"page":"94-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Min-Sum 2-Paths Problems"],"prefix":"10.1007","volume":"58","author":[{"given":"Trevor","family":"Fenner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oded","family":"Lachish","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,9,17]]},"reference":[{"key":"9569_CR1","doi-asserted-by":"crossref","unstructured":"Han, J., Jahanian, F.: Impact of path diversity on multi-homed and overlay networks. In: DSN 2004, p. 29. IEEE Computer Society (2004)","DOI":"10.1109\/DSN.2004.1311874"},{"key":"9569_CR2","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/0024-3795(89)90481-3","volume":"114\u2013115","author":"R Hassin","year":"1989","unstructured":"Hassin, R., Megiddo, N.: On orientations and shortest paths. Linear Algebra Appl. 114\u2013115, 589\u2013602 (1989)","journal-title":"Linear Algebra Appl."},{"key":"9569_CR3","doi-asserted-by":"crossref","unstructured":"Ito, T., Miyamoto, Y., Ono, H., Tamaki, H., Uehara, R.: Route-enabling graph orientation problems. In: ISAAC 2009, volume 5878 of LNCS, pp. 403\u2013412. Springer (2009)","DOI":"10.1007\/978-3-642-10631-6_42"},{"key":"9569_CR4","doi-asserted-by":"crossref","unstructured":"Kammer, F., Tholey, T.: The k-disjoint paths problem on chordal graphs. In: WG 2009, volume 5911 of LNCS, pp. 190\u2013201. Springer (2009)","DOI":"10.1007\/978-3-642-11409-0_17"},{"key":"9569_CR5","doi-asserted-by":"crossref","unstructured":"Kobayashi, Y., Sommer, Ch.: On shortest disjoint paths in planar graphs. In: ISAAC 2009, volume 5878 of LNCS, pp. 293\u2013302. Springer (2009)","DOI":"10.1007\/978-3-642-10631-6_31"},{"issue":"1","key":"9569_CR6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0166-218X(90)90024-7","volume":"26","author":"C Li","year":"1989","unstructured":"Li, C., McCormick, T. S., Simich-Levi, D.: The complexity of finding two disjoint paths with min-max objective function. Discret. Appl. Math. 26(1), 105\u2013115 (1989)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"9569_CR7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Ser. B 63(1), 65\u2013110 (1995)","journal-title":"J. Comb. Theory Ser. B"},{"key":"9569_CR8","unstructured":"Vasudevan, V., Andersen, D.G., Zhang, H.: Understanding the AS-level path disjointness provided by multi-homing. Technical Report CMU-CS-07-141, Carnegie Mellon University (2007)"},{"key":"9569_CR9","doi-asserted-by":"crossref","unstructured":"Yang, B., Zheng, S. Q.: Finding min-sum disjoint shortest paths from a single source to all pairs of destinations. In: TAMC 2006, volume 3959 of LNCS, pp. 206\u2013216. Springer (2006)","DOI":"10.1007\/11750321_20"},{"key":"9569_CR10","doi-asserted-by":"crossref","unstructured":"Zhang, P., Zhao, W.: On the complexity and approximation of the min-sum and min-max disjoint paths problems. In: ESCAPE 2007, volume 4614 of LNCS, pp. 70\u201381. Springer (2007)","DOI":"10.1007\/978-3-540-74450-4_7"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9569-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-014-9569-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9569-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T13:02:31Z","timestamp":1746363751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-014-9569-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,17]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9569"],"URL":"https:\/\/doi.org\/10.1007\/s00224-014-9569-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,17]]}}}