Generalizedk-multiway cut problems

This paper considers the following problem: given an edgeweighted graphG = (V, E, w) and disjointk-subsetsUp ofV, find a minimum weighted set of edgesE′ ⊆E such that its removal disconnects the graph intok parts and each part contains exactly one vertex from eachUp for 1 ≤p ≤r. This generalizes some well-known NP-hard problems. In this paper, we first apply greedy local search algorithm to obtain better approximation solutions. Then we give a randomized local search algorithm which produces a solution within a factor (1 + ε) with the probability at least (1 - 1/e) for any small ε. Simple near-optimum approximation algorithms are also proposed.Analogously, there is a maximumk-multiway cut problem with the same restrictions.

[1]  Mihalis Yannakakis,et al.  The Complexity of Multiterminal Cuts , 1994, SIAM J. Comput..

[2]  Mihalis Yannakakis,et al.  Simple Local Search Problems That are Hard to Solve , 1991, SIAM J. Comput..

[3]  Lov K. Grover.  Local search and the local structure of NP-complete problems , 1992, Oper. Res. Lett..

[4]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[5]  Jingke Li,et al.  Index domain alignment: minimizing cost of cross-referencing between distributed arrays , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.

[6]  Spyros Tragoudas,et al.  Minmax-cut graph partitioning problems , 1993, [1993] Proceedings Third Great Lakes Symposium on VLSI-Design Automation of High Performance VLSI Systems.

[7]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[8]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[9]  Mikkel Thorup,et al.  Rounding algorithms for a geometric embedding of minimum multiway cut , 1999, STOC '99.

[10]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[11]  Noga Alon,et al.  The Probabilistic Method, Second Edition , 2004 .

[12]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[13]  Jiping Liu,et al.  Approximation Algorithms for Some Graph Partitioning Problems , 2000, J. Graph Algorithms Appl..

[14]  Manish Gupta,et al.  Demonstration of Automatic Data Partitioning Techniques for Parallelizing Compilers on Multicomputers , 1992, IEEE Trans. Parallel Distributed Syst..

[15]  Guy L. Steele,et al.  Data Optimization: Allocation of Arrays to Reduce Communication on SIMD Machines , 1990, J. Parallel Distributed Comput..