Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms

@inproceedings{Neumann2008ApproximatingMM,
  title={Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms},
  author={Frank Neumann and Joachim Reichel},
  booktitle={PPSN},
  year={2008}
}
It 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. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Crossover is provably useful in evolutionary computation

B. Doerr, E. Happ, C. Klein
In Proc. of the 10th Genetic and Evolutionary Computation Conference (GECCO ’08). ACM Press, • 2008
View 1 Excerpt

Erratum to ‘M.-C. Costa, L. Létocard and F. Roupin: Minimal multicut and maximal integer maxiflow: A survey

C. Bentz, M.-C. Costa, L. Létocard, F. Roupin
[European Journal of Operational Research • 2005

Similar Papers

Loading similar papers…