{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:59:51Z","timestamp":1743073191366,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"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_12","type":"book-chapter","created":{"date-parts":[[2020,4,13]],"date-time":"2020-04-13T21:03:32Z","timestamp":1586811812000},"page":"144-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation"],"prefix":"10.1007","author":[{"given":"Naveen","family":"Garg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikhil","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s","family":"Seb\u0151","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,14]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0012-365X(76)90147-3","volume":"16","author":"K Appel","year":"1976","unstructured":"Appel, K., Haken, W.: A proof of the four color theorem. Discrete Math. 16, 179\u2013180 (1976)","journal-title":"Discrete Math."},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. J. ACM 41(1), 153\u2013180 (1994)","journal-title":"J. ACM"},{"issue":"4","key":"12_CR3","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.orl.2008.01.009","volume":"36","author":"J Cheriyan","year":"2008","unstructured":"Cheriyan, J., Karloff, H., Khandekar, R., K\u00f6nemann, J.: On the integrality ratio for tree augmentation. Oper. Res. Lett. 36(4), 399\u2013401 (2008)","journal-title":"Oper. Res. Lett."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"I","author":"J Edmonds","year":"1977","unstructured":"Edmonds, J., Rick, G.: A min-max relation for submodular functions in graphs. Ann. Discrete Math. I, 185\u2013204 (1977)","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-006-0063-7","volume":"110","author":"S Fiorini","year":"1995","unstructured":"Fiorini, S., Hardy, N., Reed, B., Vetta, A.: Approximate min-max relations for odd cycles in planar graphs. Math. Program. 110(1), 71\u201391 (1995)","journal-title":"Math. Program."},{"key":"12_CR6","first-page":"201","volume":"70","author":"A Frank","year":"1995","unstructured":"Frank, A., Szigeti, Z.: A note on packing paths in planar graphs. Math. Program. 70, 201\u2013209 (1995)","journal-title":"Math. Program."},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1137\/S0097539793243016","volume":"25","author":"N Garg","year":"1996","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi) cut theorems and their applications. SIAM J. Comput. 25(2), 235\u2013251 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"12_CR8","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"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Hoffman, A.J., Kruskal, J.B.: Integral boundary points of convex polyhedra. In: Linear Inequalities and Related Systems, pp. 223\u2013246 (1956)","DOI":"10.1515\/9781400881987-014"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Klein, P., Plotkin, S.A., Rao, S.: Excluded minors, network decomposition, and multicommodity flow. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 682\u2013690. ACM (1993)","DOI":"10.1145\/167088.167261"},{"key":"12_CR11","unstructured":"Klein, P.N., Mathieu, C., Zhou, H.: Correlation clustering and two-edge-connected augmentation for planar graphs. In: 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF01581198","volume":"55","author":"E Korach","year":"1992","unstructured":"Korach, E., Penn, M.: Tight integral duality gap in the chinese postman problem. Mateh. Program. 55, 183\u2013191 (1992)","journal-title":"Mateh. Program."},{"key":"12_CR13","series-title":"Collection Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24488-9","volume-title":"Combinatorial Optimization: Theory and Algorithms,","author":"B Korte","year":"2012","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, Collection Algorithms and Combinatorics, vol. 21, 5th edn. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-24488-9","edition":"5"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0095-8956(03)00078-9","volume":"90","author":"D Kr\u00e1l","year":"2004","unstructured":"Kr\u00e1l, D., Voss, H.: Edge-disjoint odd cycles in planar graphs. J. Comb. Theor. Ser. B 90, 107\u2013120 (2004)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"12_CR15","unstructured":"Lov\u00e1sz, L., Plummer, M.: Matching Theory. Akad\u00e9miai Kiad\u00f3 and Springer (1986)"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01202792","volume":"13","author":"M Middendorf","year":"1993","unstructured":"Middendorf, M., Pfeiffer, F.: On the complexity of the disjoint paths problem. Combinatorica 13(1), 97\u2013107 (1993)","journal-title":"Combinatorica"},{"issue":"1","key":"12_CR17","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"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Robertson, N., Sanders, D.P., Seymour, P., Thomas, R.: Efficiently four-coloring planar graphs. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 571\u2013575 (1996)","DOI":"10.1145\/237814.238005"},{"key":"12_CR19","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley and Chichester (1986)"},{"key":"12_CR20","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer, Heidelberg (2003)"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Seguin-Charbonneau, L., Bruce Shepherd, F.: Maximum edge-disjoint paths in planar graphs with congestion 2. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 200\u2013209. IEEE (2011)","DOI":"10.1109\/FOCS.2011.30"},{"issue":"1","key":"12_CR22","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1112\/plms\/s3-42.1.178","volume":"3","author":"PD Seymour","year":"1981","unstructured":"Seymour, P.D.: On odd cuts and plane multicommodity flows. Proc. London Math. Soc. 3(1), 178\u2013192 (1981)","journal-title":"Proc. London Math. Soc."},{"issue":"2","key":"12_CR23","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(93)90228-2","volume":"47","author":"\u00c9 Tardos","year":"1993","unstructured":"Tardos, \u00c9., Vazirani, V.V.: Improved bounds for the max-flow min-multicut ratio for planar and k$$\\_$$r, r-free graphs. Inf. Process. Lett. 47(2), 77\u201380 (1993)","journal-title":"Inf. Process. Lett."},{"key":"12_CR24","first-page":"1","volume":"69","author":"WT Tutte","year":"1965","unstructured":"Tutte, W.T.: Lectures on matroids. J. Res. Nat. Bur. Stan. B 69, 1\u201347 (1965)","journal-title":"J. Res. Nat. Bur. Stan. B"},{"issue":"3","key":"12_CR25","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/BF01299747","volume":"15","author":"DP Williamson","year":"1995","unstructured":"Williamson, D.P., Goemans, M.X., Mihail, M., Vazirani, V.V.: A primal-dual approximation algorithm for generalized steiner network problems. Combinatorica 15(3), 435\u2013454 (1995)","journal-title":"Combinatorica"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T23:10:16Z","timestamp":1589929816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45771-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030457709","9783030457716"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45771-6_12","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)"}}]}}