Neumann, FrankReichel, Joachim2009-05-122009-05-122008-06http://hdl.handle.net/2003/26156http://dx.doi.org/10.17877/DE290R-12771It has been shown that simple evolutionary algorithms are able to solve the minimum cut problem in expected polynomial time when using a multi-objective model of the problem. In this paper, we generalize these ideas to the NP-hard minimum multicut problem. Given a set of k terminal pairs, we prove that evolutionary algorithms in combination with a multi-objective model of the problem are able to obtain a k-approximation for this problem in expected polynomial time.en004Text