|Title:||Computing minimum cuts by randomized search heuristics|
|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.|
|Subject Headings:||analysis of algorithms and problem complexity|
randomized search heuristics
theory of computation
|Appears in Collections:||Sonderforschungsbereich (SFB) 531|
This item is protected by original copyright
If no CC-License is given, pleas contact the the creator, if you want to use thre resource other than only read it.