{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T17:25:14Z","timestamp":1784568314728,"version":"3.55.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T00:00:00Z","timestamp":1646352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2022,4,30]]},"abstract":"<jats:p>\n            We show the existence of an exact mimicking network of\n            <jats:italic>\n              k\n              <jats:sup>O<\/jats:sup>\n            <\/jats:italic>\n            (\n            <jats:sup>\n              log\n              <jats:italic>k<\/jats:italic>\n            <\/jats:sup>\n            ) edges for minimum multicuts over a set of terminals in an undirected graph, where\n            <jats:italic>k<\/jats:italic>\n            is the total capacity of the terminals, i.e., the sum of the degrees of the terminal vertices. Furthermore, using the best available approximation algorithm for\n            <jats:sc>Small Set Expansion<\/jats:sc>\n            , we show that a mimicking network of\n            <jats:italic>\n              k\n              <jats:sup>O<\/jats:sup>\n            <\/jats:italic>\n            (\n            <jats:sup>\n              log3\n              <jats:italic>k<\/jats:italic>\n            <\/jats:sup>\n            ) edges can be computed in randomized polynomial time. As a consequence, we show quasipolynomial kernels for several problems, including\n            <jats:sc>Edge Multiway Cut<\/jats:sc>\n            ,\n            <jats:sc>Group Feedback Edge Set<\/jats:sc>\n            for an arbitrary group, and\n            <jats:sc>Edge Multicut<\/jats:sc>\n            parameterized by the solution size and the number of cut requests. The result combines the matroid-based irrelevant edge approach used in the kernel for\n            <jats:sc>\n              <jats:italic>s<\/jats:italic>\n              -Multiway Cut\n            <\/jats:sc>\n            with a recursive decomposition and sparsification of the graph along sparse cuts. This is the first progress on the kernelization of\n            <jats:sc>Multiway Cut<\/jats:sc>\n            problems since the kernel for\n            <jats:sc>\n              <jats:italic>s<\/jats:italic>\n              -Multiway Cut\n            <\/jats:sc>\n            for constant value of\n            <jats:italic>s<\/jats:italic>\n            (Kratsch and Wahlstr\u00f6m, FOCS 2012).\n          <\/jats:p>","DOI":"10.1145\/3501304","type":"journal-article","created":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T11:32:35Z","timestamp":1646393555000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems"],"prefix":"10.1145","volume":"18","author":[{"given":"Magnus","family":"Wahlstr\u00f6m","sequence":"first","affiliation":[{"name":"Royal Holloway, University of London, Egham Hill, Egham, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,3,4]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.07.017"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.20"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1137\/120873996"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.04.001"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214039"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3426738"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792225297"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1137\/130908440"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/2886094"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1017\/9781107415157"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.06.007"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793243016"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1592"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-017-9805-6"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0504-8"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.02.011"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1137\/16M1104585"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/2635810"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3390887"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1137\/17M1151225"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.128"},{"key":"e_1_3_2_24_2","article-title":"LP-branching algorithms based on biased graphs","volume":"1610","author":"Lee Euiwoong","year":"2020","unstructured":"Euiwoong Lee and Magnus Wahlstr\u00f6m. 2020. LP-branching algorithms based on biased graphs. CoRR abs\/1610. 06060v2 (2020).","journal-title":"CoRR"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806698"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3170444"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2016.v012a017"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.46"},{"key":"e_1_3_2_29_2","first-page":"45","volume-title":"Proc. Sixth British Combinatorial Conf. (Combinatorial Surveys)","author":"Lov\u00e1sz L\u00e1szl\u00f3","year":"1977","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz. 1977. Flats in matroids and geometric graphs. In Proc. Sixth British Combinatorial Conf. (Combinatorial Surveys). 45\u201386."},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.3390\/a11010010"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.10.007"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.07.027"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.28"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580444"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181881"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374415"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806792"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2012.43"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.94"},{"key":"e_1_3_2_41_2","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"Schrijver A.","year":"2003","unstructured":"A. Schrijver. 2003. Combinatorial Optimization: Polyhedra and Efficiency. Springer."},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.102"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2020.101"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3501304","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3501304","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:19Z","timestamp":1750188619000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3501304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,4]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4,30]]}},"alternative-id":["10.1145\/3501304"],"URL":"https:\/\/doi.org\/10.1145\/3501304","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,4]]},"assertion":[{"value":"2021-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-03-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}