{"date_updated":"2023-02-17T14:02:04Z","day":"01","doi":"10.1137/1.9781611976007.4","author":[{"last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Alexander","full_name":"Noe, Alexander","last_name":"Noe"},{"last_name":"Schulz","full_name":"Schulz, Christian","first_name":"Christian"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","external_id":{"arxiv":["1908.04141"]},"language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["978-1-61197-600-7"]},"month":"01","abstract":[{"text":"We introduce the fastest known exact algorithm for the multiterminal cut problem with k terminals. In particular, we engineer existing as well as new data reduction rules. We use the rules within a branch-and-reduce framework and to boost the performance of an ILP formulation. Our algorithms achieve improvements in running time of up to multiple orders of magnitudes over the ILP formulation without data reductions, which has been the de facto standard used by practitioners. This allows us to solve instances to optimality that are significantly larger than was previously possible.","lang":"eng"}],"citation":{"apa":"Henzinger, M. H., Noe, A., &#38; Schulz, C. (2020). Shared-memory branch-and-reduce for multiterminal cuts. In <i>2020 Symposium on Algorithm Engineering and Experiments</i> (pp. 42–55). Salt Lake City, UT, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976007.4\">https://doi.org/10.1137/1.9781611976007.4</a>","mla":"Henzinger, Monika H., et al. “Shared-Memory Branch-and-Reduce for Multiterminal Cuts.” <i>2020 Symposium on Algorithm Engineering and Experiments</i>, Society for Industrial and Applied Mathematics, 2020, pp. 42–55, doi:<a href=\"https://doi.org/10.1137/1.9781611976007.4\">10.1137/1.9781611976007.4</a>.","short":"M.H. Henzinger, A. Noe, C. Schulz, in:, 2020 Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2020, pp. 42–55.","chicago":"Henzinger, Monika H, Alexander Noe, and Christian Schulz. “Shared-Memory Branch-and-Reduce for Multiterminal Cuts.” In <i>2020 Symposium on Algorithm Engineering and Experiments</i>, 42–55. Society for Industrial and Applied Mathematics, 2020. <a href=\"https://doi.org/10.1137/1.9781611976007.4\">https://doi.org/10.1137/1.9781611976007.4</a>.","ista":"Henzinger MH, Noe A, Schulz C. 2020. Shared-memory branch-and-reduce for multiterminal cuts. 2020 Symposium on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 42–55.","ieee":"M. H. Henzinger, A. Noe, and C. Schulz, “Shared-memory branch-and-reduce for multiterminal cuts,” in <i>2020 Symposium on Algorithm Engineering and Experiments</i>, Salt Lake City, UT, United States, 2020, pp. 42–55.","ama":"Henzinger MH, Noe A, Schulz C. Shared-memory branch-and-reduce for multiterminal cuts. In: <i>2020 Symposium on Algorithm Engineering and Experiments</i>. Society for Industrial and Applied Mathematics; 2020:42-55. doi:<a href=\"https://doi.org/10.1137/1.9781611976007.4\">10.1137/1.9781611976007.4</a>"},"publisher":"Society for Industrial and Applied Mathematics","status":"public","scopus_import":"1","year":"2020","oa":1,"publication":"2020 Symposium on Algorithm Engineering and Experiments","article_processing_charge":"No","date_published":"2020-01-01T00:00:00Z","_id":"11881","main_file_link":[{"url":"https://arxiv.org/abs/1908.04141","open_access":"1"}],"conference":{"name":"ALENEX: Symposium on Algorithm Engineering and Experiments","end_date":"2020-01-06","start_date":"2020-01-05","location":"Salt Lake City, UT, United States"},"quality_controlled":"1","page":"42-55","oa_version":"Preprint","extern":"1","date_created":"2022-08-17T06:47:40Z","title":"Shared-memory branch-and-reduce for multiterminal cuts","publication_status":"published"}