{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:12:55Z","timestamp":1761621175646,"version":"3.40.4"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080000"},{"type":"electronic","value":"9783319080017"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08001-7_1","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T16:53:00Z","timestamp":1402419180000},"page":"1-11","source":"Crossref","is-referenced-by-count":3,"title":["Min-Sum 2-Paths Problems"],"prefix":"10.1007","author":[{"given":"Trevor","family":"Fenner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oded","family":"Lachish","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_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":"1_CR2","doi-asserted-by":"crossref","unstructured":"Hassin, R., Megiddo, N.: On orientations and shortest paths. Linear Algebra Appl. 114\u2013115, 589\u2013602 (1989)","DOI":"10.1016\/0024-3795(89)90481-3"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-10631-6_42","volume-title":"Algorithms and Computation","author":"T. Ito","year":"2009","unstructured":"Ito, T., Miyamoto, Y., Ono, H., Tamaki, H., Uehara, R.: Route-enabling graph orientation problems. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 403\u2013412. Springer, Heidelberg (2009)"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-11409-0_17","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F. Kammer","year":"2010","unstructured":"Kammer, F., Tholey, T.: The k-disjoint paths problem on chordal graphs. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol.\u00a05911, pp. 190\u2013201. Springer, Heidelberg (2010)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-10631-6_31","volume-title":"Algorithms and Computation","author":"Y. Kobayashi","year":"2009","unstructured":"Kobayashi, Y., Sommer, C.: On shortest disjoint paths in planar graphs. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 293\u2013302. Springer, Heidelberg (2009)"},{"issue":"1","key":"1_CR6","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.S., Simich-Levi, D.: The complexity of finding two disjoint paths with min-max objective function. Discrete Appl. Math.\u00a026(1), 105\u2013115 (1989)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","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\u00a063(1), 65\u2013110 (1995)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1_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":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/11750321_20","volume-title":"Theory and Applications of Models of Computation","author":"B. Yang","year":"2006","unstructured":"Yang, B., Zheng, S.Q.: Finding min-sum disjoint shortest paths from a single source to all pairs of destinations. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol.\u00a03959, pp. 206\u2013216. Springer, Heidelberg (2006)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-74450-4_7","volume-title":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","author":"P. Zhang","year":"2007","unstructured":"Zhang, P., Zhao, W.: On the complexity and approximation of the min-sum and min-max disjoint paths problems. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol.\u00a04614, pp. 70\u201381. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08001-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:05:21Z","timestamp":1746263121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08001-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080000","9783319080017"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08001-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}