Min-Max Multiway Cut
We propose the Min-max multiway cut problem, a variant of the traditional Multiway cut problem, but with the goal of minimizing the maximum capacity (rather than the sum or average capacity) leaving a part of the partition. The problem is motivated by data partitioning in Peer-to-Peer networks. The min-max objective function forces the solution not to overload any given terminal, and hence may lead to better solution quality.
We prove that the Min-max multiway cut is NP-hard even on trees, or with only a constant number of terminals. Our main result is an O(log3 n)-approximation algorithm for general graphs, and an O(log2 n)-approximation for graphs excluding any fixed graph as a minor (e.g., planar graphs). We also give a (2+ε)-approximation algorithm for the special case of graphs with bounded treewidth.
KeywordsApproximation Algorithm Polynomial Time Planar Graph Maximum Capacity Approximation Guarantee
Unable to display preview. Download preview PDF.
- 1.Calinescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. In: STOC (1998)Google Scholar
- 6.Karger, D.R., Klein, P., Stein, C., Thorup, M., Young, N.E.: Rounding algorithms for a geometric embedding of minimum multiway cut. In: STOC (1999)Google Scholar
- 7.Kleinberg, J., Tardos, E.: Algorithms Design. Addison-Wesley, Reading (to appear)Google Scholar