A simple algorithm for the multiway cut problem
Operations Research Letters(2019)
摘要
Multiway Cut is a classic graph partitioning problem in which the goal is to disconnect a given set of special vertices called terminals. This problem admits a rich sequence of works. Unfortunately, most of these works resort to the mix of multiple algorithmic components, resulting in both complicated algorithms and analysis. We present a simple algorithm for the Multiway Cut problem that is comprised of a single algorithmic component and achieves an approximation of 118=1.375.
更多查看译文
关键词
Multiway cut,Approximation algorithms,Randomized rounding,Simplex transformation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络