{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:37:01Z","timestamp":1742960221137,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030457709"},{"type":"electronic","value":"9783030457716"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45771-6_23","type":"book-chapter","created":{"date-parts":[[2020,4,13]],"date-time":"2020-04-13T21:03:32Z","timestamp":1586811812000},"page":"294-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds"],"prefix":"10.1007","author":[{"given":"Sarah","family":"Morell","sequence":"first","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,14]]},"reference":[{"key":"23_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall Inc., Upper Saddle River (1993)"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s00453-005-1167-9","volume":"42","author":"G Baier","year":"2005","unstructured":"Baier, G., K\u00f6hler, E., Skutella, M.: On the $$k$$-splittable flow problem. Algorithmica 42, 231\u2013248 (2005). https:\/\/doi.org\/10.1007\/s00453-005-1167-9","journal-title":"Algorithmica"},{"key":"23_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":"23_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1064546.1180614","volume":"10","author":"J Du","year":"2005","unstructured":"Du, J., Kolliopoulos, S.: Implementing approximation algorithms for the single-source unsplittable flow problem. J. Exp. Algorithmics 10, 2\u20133 (2005)","journal-title":"J. Exp. Algorithmics"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)","DOI":"10.1515\/9781400875184"},{"key":"23_CR6","unstructured":"Kleinberg, J.M.: Approximation algorithms for disjoint paths problems. Ph.D. thesis, M.I.T. (1996)"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/s00224-007-9068-8","volume":"43","author":"R Koch","year":"2008","unstructured":"Koch, R., Skutella, M., Spenke, I.: Maximum $$k$$-splittable $$s, t$$-flows. Theor. Comput. Syst. 43, 56\u201366 (2008). https:\/\/doi.org\/10.1007\/s00224-007-9068-8","journal-title":"Theor. Comput. Syst."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ipl.2004.12.009","volume":"94","author":"SG Kolliopoulos","year":"2005","unstructured":"Kolliopoulos, S.G.: Minimum-cost single-source 2-splittable flow. Inf. Process. Lett. 94, 15\u201318 (2005)","journal-title":"Inf. Process. Lett."},{"key":"23_CR9","volume-title":"Handbook of Approximation Algorithms and Metaheuristics","author":"SG Kolliopoulos","year":"2007","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, Boca Raton (2007)"},{"key":"23_CR10","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)","journal-title":"SIAM J. Comput."},{"key":"23_CR11","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":"23_CR12","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P Raghavan","year":"1988","unstructured":"Raghavan, P.: Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. Syst. Sci. 37, 130\u2013143 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 365\u2013374 (1987). https:\/\/doi.org\/10.1007\/BF02579324","journal-title":"Combinatorica"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.orl.2008.12.004","volume":"37","author":"F Salazar","year":"2009","unstructured":"Salazar, F., Skutella, M.: Single-source $$k$$-splittable min-cost flows. Oper. Res. Lett. 37, 71\u201374 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"23_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":"23_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/9781316888568","volume-title":"Network Flow Algorithms","author":"DP Williamson","year":"2019","unstructured":"Williamson, D.P.: Network Flow Algorithms. Cambridge University Press, Cambridge (2019)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45771-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,8]],"date-time":"2021-03-08T16:49:30Z","timestamp":1615222170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45771-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030457709","9783030457716"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45771-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 April 2020","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":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.xixilogic.org\/events\/clar2020\/","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":"126","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":"26% - 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":"26","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}