{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:15:50Z","timestamp":1787508950122,"version":"build-2736575974"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T00:00:00Z","timestamp":1646611200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T00:00:00Z","timestamp":1646611200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["NSERC RGPIN-2020-06141"],"award-info":[{"award-number":["NSERC RGPIN-2020-06141"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s10107-022-01780-0","type":"journal-article","created":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T10:02:46Z","timestamp":1646647366000},"page":"1049-1067","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators"],"prefix":"10.1007","volume":"197","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5460-9995","authenticated-orcid":false,"given":"Guyslain","family":"Naves","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1972-1396","authenticated-orcid":false,"given":"F. Bruce","family":"Shepherd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Henry","family":"Xia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,3,7]]},"reference":[{"key":"1780_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Bartal, Y., Neiman, O.: Nearly tight low stretch spanning trees. In: FOCS, pp. 781\u2013790 (2008)","DOI":"10.1109\/FOCS.2008.62"},{"issue":"1","key":"1780_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1137\/S0097539792224474","volume":"24","author":"N Alon","year":"1995","unstructured":"Alon, N., Karp, R.M., Peleg, D., West, D.: A graph-theoretic game and its application to the k-server problem. SIAM J. Comput. 24(1), 78\u2013100 (1995)","journal-title":"SIAM J. Comput."},{"key":"1780_CR3","unstructured":"Andersen, R., Feige, U.: Interchanging distance and capacity in probabilistic mappings. arXiv preprint arXiv:0907.3631 (2009)"},{"key":"1780_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/060674442","volume":"39","author":"C Chekuri","year":"2009","unstructured":"Chekuri, C., Khanna, S., Shepherd, F.B.: Edge-disjoint paths in planar graphs with constant congestion. SIAM J. Comput. 39, 281\u2013301 (2009)","journal-title":"SIAM J. Comput."},{"key":"1780_CR5","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Ene, A.: Poly-logarithmic approximation for maximum node disjoint paths with constant congestion. In: Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, pp. 326\u2013341. SIAM (2013)","DOI":"10.1137\/1.9781611973105.24"},{"key":"1780_CR6","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Khanna, S., Shepherd, F.B.: The all-or-nothing multicommodity flow problem. In: STOC \u201904: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pp. 156\u2013165, New York, NY, USA (2004). ACM","DOI":"10.1145\/1007352.1007383"},{"issue":"4","key":"1780_CR7","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1137\/100796820","volume":"42","author":"C Chekuri","year":"2013","unstructured":"Chekuri, C., Khanna, S., Shepherd, F.B.: The all-or-nothing multicommodity flow problem. SIAM J. Comput. 42(4), 1467\u20131493 (2013)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1780_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1273340.1273343","volume":"3","author":"C Chekuri","year":"2007","unstructured":"Chekuri, C., Mydlarz, M., Shepherd, F.B.: Multicommodity demand flow in a tree and packing integer programs. ACM Trans. Algorithms (TALG) 3(3), 27 (2007)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"1780_CR9","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Naves, G., Shepherd, F.B.: Maximum edge-disjoint paths in k-sums of graphs. In: International Colloquium on Automata, Languages, and Programming, pp. 328\u2013339. Springer (2013)","DOI":"10.1007\/978-3-642-39206-1_28"},{"key":"1780_CR10","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Li, S.: A polylogarithimic approximation algorithm for edge-disjoint paths with congestion 2. arXiv preprint arXiv:1208.1272 (2012)","DOI":"10.1109\/FOCS.2012.54"},{"key":"1780_CR11","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Li, S.: A polylogarithimic approximation algorithm for edge-disjoint paths with congestion 2. In: Proceedings of IEEE FOCS (2012)","DOI":"10.1109\/FOCS.2012.54"},{"key":"1780_CR12","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Kim, D.H.K., Nimavat, R.: New hardness results for routing on disjoint paths. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 86\u201399 (2017)","DOI":"10.1145\/3055399.3055411"},{"issue":"2","key":"1780_CR13","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1137\/050641661","volume":"38","author":"M Elkin","year":"2008","unstructured":"Elkin, M., Emek, Y., Spielman, D.A., Teng, S.-H.: Lower-stretch spanning trees. SIAM J. Comput. 38(2), 608\u2013628 (2008)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"1780_CR14","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1137\/130908440","volume":"43","author":"M Englert","year":"2014","unstructured":"Englert, M., Gupta, A., Krauthgamer, R., Racke, H., Talgam-Cohen, I., Talwar, K.: Vertex sparsifiers: new results from old techniques. SIAM J. Comput. 43(4), 1239\u20131262 (2014)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1780_CR15","doi-asserted-by":"publisher","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":"1780_CR16","doi-asserted-by":"crossref","unstructured":"Garg, N., Kumar, N., Seb\u0151, A.: Integer plane multiflow maximisation: flow-cut gap and one-quarter-approximation. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 144\u2013157. Springer (2020)","DOI":"10.1007\/978-3-030-45771-6_12"},{"issue":"1","key":"1780_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N Garg","year":"1997","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18(1), 3\u201320 (1997)","journal-title":"Algorithmica"},{"issue":"2","key":"1780_CR18","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00493-004-0015-x","volume":"24","author":"A Gupta","year":"2004","unstructured":"Gupta, A., Newman, I., Rabinovich, Y., Sinclair, A.: Cuts, trees and $$\\ell _1$$-embeddings of graphs. Combinatorica 24(2), 233\u2013269 (2004)","journal-title":"Combinatorica"},{"key":"1780_CR19","first-page":"220","volume":"1","author":"A Gupta","year":"2001","unstructured":"Gupta, A.: Steiner points in tree metrics don\u2019t (really) help. SODA 1, 220\u2013227 (2001)","journal-title":"SODA"},{"issue":"3","key":"1780_CR20","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0022-0000(03)00066-7","volume":"67","author":"V Guruswami","year":"2003","unstructured":"Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci. 67(3), 473\u2013496 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"1780_CR21","doi-asserted-by":"crossref","unstructured":"Harrelson, C., Hildrum, K., Rao, S.: A polynomial-time tree decomposition to minimize congestion. In: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, pp. 34\u201343 (2003)","DOI":"10.1145\/777412.777419"},{"key":"1780_CR22","doi-asserted-by":"crossref","unstructured":"Huang, C.-C., Mari, M., Mathieu, C., Schewior, K., Vygen, J.: An approximation algorithm for fully planar edge-disjoint paths. arXiv preprint arXiv:2001.01715 (2020)","DOI":"10.1137\/20M1319401"},{"issue":"4","key":"1780_CR23","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.1137\/130932326","volume":"47","author":"K Kawarabayashi","year":"2018","unstructured":"Kawarabayashi, K., Kobayashi, Y.: All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs. SIAM J. Comput. 47(4), 1483\u20131504 (2018)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1780_CR24","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1006\/jcss.1998.1579","volume":"57","author":"J Kleinberg","year":"1998","unstructured":"Kleinberg, J., Tardos, E.: Approximations for the disjoint paths problem in high-diameter planar networks. J. Comput. Syst. Sci. 57(1), 61\u201373 (1998)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"1780_CR25","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","volume":"31","author":"H Okamura","year":"1981","unstructured":"Okamura, H., Seymour, P.D.: Multicommodity flows in planar graphs. J. Combin. Theory Ser. B 31(1), 75\u201381 (1981)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"1780_CR26","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/PL00009336","volume":"19","author":"Y Rabinovich","year":"1998","unstructured":"Rabinovich, Y., Raz, R.: Lower bounds on the distortion of embedding finite metric spaces in graphs. Discrete Comput. Geom. 19(1), 79\u201394 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"1780_CR27","unstructured":"R\u00e4cke, H.: Minimizing congestion in general networks. In: Proceedings of IEEE FOCS, pp. 43\u201352 (2002)"},{"key":"1780_CR28","doi-asserted-by":"crossref","unstructured":"R\u00e4cke, H.: Optimal hierarchical decompositions for congestion minimization in networks. In: STOC, pp. 255\u2013264 (2008)","DOI":"10.1145\/1374376.1374415"},{"key":"1780_CR29","doi-asserted-by":"crossref","unstructured":"R\u00e4cke, H., Shah, C.: Improved guarantees for tree cut sparsifiers. In: European Symposium on Algorithms, pp. 774\u2013785. Springer (2014)","DOI":"10.1007\/978-3-662-44777-2_64"},{"key":"1780_CR30","first-page":"29","volume":"1","author":"L Seguin-Charbonneau","year":"2020","unstructured":"Seguin-Charbonneau, L., Shepherd, F.B.: Maximum edge-disjoint paths in planar graphs with congestion. Math. Program. 1, 29 (2020)","journal-title":"Math. Program."},{"issue":"3","key":"1780_CR31","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0195-6698(81)80033-9","volume":"2","author":"PD Seymour","year":"1981","unstructured":"Seymour, P.D.: Matroids and multicommodity flows. Eur. J. Combin. 2(3), 257\u2013290 (1981)","journal-title":"Eur. J. Combin."},{"key":"1780_CR32","unstructured":"Sidiropoulos, A.: Private communication (2014)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01780-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01780-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01780-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T12:19:46Z","timestamp":1675685986000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01780-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,7]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1780"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01780-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,7]]},"assertion":[{"value":"7 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}