Colored Multiway Cuts in Trees of Rings

摘要

The colored multiway cut problem generalizes the traditional multiway cut problem. It is motivated by data partitioning in peer-to-peer networks. A polynomial time algorithm is presented that solves the problem exactly for trees of rings.