{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:35:17Z","timestamp":1760056517191,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031931116"},{"type":"electronic","value":"9783031931123"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-93112-3_31","type":"book-chapter","created":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T04:56:18Z","timestamp":1749531378000},"page":"427-441","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Integer and\u00a0Unsplittable Multiflows in\u00a0Series-Parallel Digraphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1988-7062","authenticated-orcid":false,"given":"Mohammed","family":"Majthoub Almoghrabi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9814-1703","authenticated-orcid":false,"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2878-6872","authenticated-orcid":false,"given":"Philipp","family":"Warode","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,4]]},"reference":[{"key":"31_CR1","volume-title":"Network Flows","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, Theory (1993)"},{"issue":"2","key":"31_CR2","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/J.JCTB.2012.11.002","volume":"103","author":"C Chekuri","year":"2013","unstructured":"Chekuri, C., Shepherd, F.B., Weibel, C.: Flow-cut gaps for integer and fractional multiflows. J. Comb. Theor. Ser. B 103(2), 248\u2013273 (2013). https:\/\/doi.org\/10.1016\/J.JCTB.2012.11.002","journal-title":"J. Comb. Theor. Ser. B"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s004930050043","volume":"19","author":"Y Dinitz","year":"1999","unstructured":"Dinitz, Y., Garg, N., Goemans, M.X.: On the single source unsplittable flow problem. Combinatorica 19, 17\u201341 (1999). https:\/\/doi.org\/10.1007\/s004930050043","journal-title":"Combinatorica"},{"key":"31_CR4","unstructured":"Kleinberg, J.M.: Approximation algorithms for disjoint paths problems. Ph.D. thesis, M.I.T. (1996). http:\/\/hdl.handle.net\/1721.1\/11013"},{"key":"31_CR5","doi-asserted-by":"publisher","unstructured":"Kolliopoulos, S.G.: Edge-disjoint paths and unsplittable flow. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics. Chapman and Hall\/CRC (2007). https:\/\/doi.org\/10.1201\/9781420010749.CH57","DOI":"10.1201\/9781420010749.CH57"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1137\/S0097539799355314","volume":"31","author":"SG Kolliopoulos","year":"2002","unstructured":"Kolliopoulos, S.G., Stein, C.: Approximation algorithms for single-source unsplittable flow. SIAM J. Comput. 31, 919\u2013946 (2002). https:\/\/doi.org\/10.1137\/S0097539799355314","journal-title":"SIAM J. Comput."},{"key":"31_CR7","doi-asserted-by":"publisher","unstructured":"Majthoub\u00a0Almoghrabi, M., Skutella, M., Warode, P.: Integer and unsplittable multiflows in series-parallel digraphs (2024). https:\/\/doi.org\/10.48550\/arXiv.2412.05182","DOI":"10.48550\/arXiv.2412.05182"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-540-75520-3_36","volume-title":"Algorithms \u2013 ESA 2007","author":"M Martens","year":"2007","unstructured":"Martens, M., Salazar, F., Skutella, M.: Convex Combinations of Single Source Unsplittable Flows. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 395\u2013406. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_36"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10107-021-01704-4","volume":"192","author":"S Morell","year":"2022","unstructured":"Morell, S., Skutella, M.: Single source unsplittable flows with arc-wise lower and upper bounds. Math. Program. 192, 477\u2013496 (2022). https:\/\/doi.org\/10.1007\/s10107-021-01704-4","journal-title":"Math. Program."},{"issue":"6","key":"31_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0020-0190(89)90087-2","volume":"31","author":"H Nagamochi","year":"1989","unstructured":"Nagamochi, H., Ibaraki, T.: On max-flow min-cut and integral flow properties for multicommodity flows in directed networks. Inf. Process. Lett. 31(6), 279\u2013285 (1989). https:\/\/doi.org\/10.1016\/0020-0190(89)90087-2","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"31_CR11","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. Theory Ser. B 31(1), 75\u201381 (1981). https:\/\/doi.org\/10.1016\/S0095-8956(81)80012-3","journal-title":"J. Comb. Theory Ser. B"},{"key":"31_CR12","doi-asserted-by":"publisher","unstructured":"Poremba, J., Shepherd, F.B.: Cut-sufficient directed 2-commodity multiflow topologies. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 408\u2013422. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-32726-1_29","DOI":"10.1007\/978-3-031-32726-1_29"},{"key":"31_CR13","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, Chichester (1986)"},{"key":"31_CR14","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer (2003)"},{"issue":"3","key":"31_CR15","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s101070100260","volume":"91","author":"M Skutella","year":"2001","unstructured":"Skutella, M.: Approximating the single source unsplittable min-cost flow problem. Math. Program. 91(3), 493\u2013514 (2001). https:\/\/doi.org\/10.1007\/s101070100260","journal-title":"Math. Program."},{"key":"31_CR16","doi-asserted-by":"publisher","unstructured":"Traub, V., Vargas Koch, L., Zenklusen, R.: Single-source unsplittable flows in planar graphs. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 639\u2013668. SIAM (2024). https:\/\/doi.org\/10.1137\/1.9781611977912.24","DOI":"10.1137\/1.9781611977912.24"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput. 11, 298\u2013313 (1982). https:\/\/doi.org\/10.1137\/0211023","journal-title":"SIAM J. Comput."},{"issue":"1","key":"31_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0166-218X(93)E0177-Z","volume":"61","author":"J Vygen","year":"1995","unstructured":"Vygen, J.: NP-completeness of some edge-disjoint paths problems. Discret. Appl. Math. 61(1), 83\u201390 (1995). https:\/\/doi.org\/10.1016\/0166-218X(93)E0177-Z","journal-title":"Discret. Appl. Math."},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Williamson, D.P.: Network Flow Algorithms. Cambridge University Press (2019)","DOI":"10.1017\/9781316888568"}],"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-031-93112-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T10:53:45Z","timestamp":1760007225000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-93112-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031931116","9783031931123"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-93112-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"4 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"Baltimore, MD","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipco25.cs.jhu.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}