{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:56:04Z","timestamp":1743026164702,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030738785"},{"type":"electronic","value":"9783030738792"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-73879-2_23","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T23:04:59Z","timestamp":1620169499000},"page":"326-339","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","author":[{"given":"Guyslain","family":"Naves","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce","family":"Shepherd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henry","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,5]]},"reference":[{"key":"23_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":"23_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":"23_CR3","unstructured":"Andersen, R., Feige, U.: Interchanging distance and capacity in probabilistic mappings. arXiv preprint arXiv:0907.3631 (2009)"},{"key":"23_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":"23_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 24th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 326\u2013341. SIAM (2013)","DOI":"10.1137\/1.9781611973105.24"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Khanna, S., Bruce Shepherd, F.: The all-or-nothing multicommodity flow problem. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC 2004, pp. 156\u2013165. ACM, New York (2004)","DOI":"10.1145\/1007352.1007383"},{"issue":"4","key":"23_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."},{"key":"23_CR8","doi-asserted-by":"crossref","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-es (2007)","DOI":"10.1145\/1273340.1273343"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-39206-1_28","volume-title":"Automata, Languages, and Programming","author":"C Chekuri","year":"2013","unstructured":"Chekuri, C., Naves, G., Shepherd, F.B.: Maximum edge-disjoint paths in k-sums of graphs. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 328\u2013339. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39206-1_28"},{"key":"23_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":"23_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":"23_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":"23_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":"23_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":"23_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. Theor. Ser. B 39(2), 164\u2013178 (1985)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-030-45771-6_12","volume-title":"Integer Programming and Combinatorial Optimization","author":"N Garg","year":"2020","unstructured":"Garg, N., Kumar, N., Seb\u0151, A.: Integer plane multiflow maximisation: flow-cut gap and one-quarter-approximation. In: Bienstock, D., Zambelli, G. (eds.) IPCO 2020. LNCS, vol. 12125, pp. 144\u2013157. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45771-6_12"},{"issue":"1","key":"23_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":"23_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":"23_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":"23_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":"23_CR21","doi-asserted-by":"crossref","unstructured":"Harrelson, C., Hildrum, K., Rao, S.: A polynomial-time tree decomposition to minimize congestion. In: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 34\u201343 (2003)","DOI":"10.1145\/777412.777419"},{"key":"23_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":"23_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":"23_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."},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Naves, G., Shepherd, B., Xia, H.: Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators. arXiv preprint arXiv:2007.10537 (2020)","DOI":"10.1007\/978-3-030-73879-2_23"},{"issue":"1","key":"23_CR26","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. Comb. Theor. Ser. B 31(1), 75\u201381 (1981)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"1","key":"23_CR27","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":"23_CR28","unstructured":"R\u00e4cke, H.: Minimizing congestion in general networks. In: Proceedings of IEEE FOCS, pp. 43\u201352 (2002)"},{"key":"23_CR29","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":"23_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1007\/978-3-662-44777-2_64","volume-title":"Algorithms - ESA 2014","author":"H R\u00e4cke","year":"2014","unstructured":"R\u00e4cke, H., Shah, C.: Improved guarantees for tree cut sparsifiers. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 774\u2013785. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_64"},{"key":"23_CR31","doi-asserted-by":"publisher","unstructured":"S\u00e9guin-Charbonneau, L., Shepherd, F.B.: Maximum edge-disjoint paths in planar graphs with congestion 2. Math. Programm., 1\u201323 (2020). https:\/\/doi.org\/10.1007\/s10107-020-01513-1","DOI":"10.1007\/s10107-020-01513-1"},{"issue":"3","key":"23_CR32","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. Comb. 2(3), 257\u2013290 (1981)","journal-title":"Eur. J. Comb."},{"key":"23_CR33","unstructured":"Sidiropoulos, A.: Private communication (2014)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-73879-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T10:22:13Z","timestamp":1672050133000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-73879-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030738785","9783030738792"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-73879-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.gatech.edu\/ipco-2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"90","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference took place virtually","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}