Computing minimum cuts by randomized search heuristics
Loading...
Date
2008-02
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
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.
Description
Table of contents
Keywords
analysis of algorithms and problem complexity, evolutionary algorithms, minimum s-t-cuts, multiobjective optimization, performance, randomized search heuristics, theory of computation