多端割的共享内存分支归约算法
Shared-Memory Branch-and-Reduce for Multiterminal Cuts
摘要：
本文介绍了已知的最快的精确算法来求解具有k个终端的多端割问题。特别是，我们工程师现有的以及新的数据减少规则。我们使用的分支和减少框架内的规则，并提高性能的ILP制定。我们的算法在运行时间上实现了多个数量级的改进，超过了ILP制定的数据减少，这已经是从业者使用的事实标准。这使我们能够解决比以前可能的大得多的最优实例。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
