direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Preprints 2008

Computing Minimum Cuts by Randomized Search Heuristics
Zitatschlüssel Report-003-2008
Autor Frank Neumann and Joachim Reichel and Martin Skutella
Jahr 2008
Nummer 003
Notiz An extended abstract appeared in Proceedings of the 10th Genetic and Evolutionary Computation Conference (GECCO'08), 779-787, 2008.
Institution Technische Universität Berlin, Institut für Mathematik
Zusammenfassung We study the minimum $s$-$t$-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimization problems that occur as crucial subproblems in many real-world optimization problems and have a variety of applications in several different areas. We prove that there exist instances of the minimum $s$-$t$-cut problem that cannot be solved by standard single-objective evolutionary algorithms in reasonable time. On the other hand, we develop a bicriteria approach based on the famous MaxFlow-MinCut Theorem that enables evolutionary algorithms to find an optimum solution in expected polynomial time.
Typ der Publikation Preprint
Link zur Publikation Download Bibtex Eintrag