The Complexity of Multiterminal Cuts
SIAM Journal on Computing
On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
Introduction to Algorithms
A new evolutionary approach to cutting stock problems with and without contiguity
Computers and Operations Research
Combining convergence and diversity in evolutionary multiobjective optimization
Evolutionary Computation
Evolutionary Algorithms and the Maximum Matching Problem
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A low-level hybridization between memetic algorithm and VNS for the max-cut problem
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Minimum spanning trees made easier via multi-objective optimization
Natural Computing: an international journal
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Theoretical Computer Science
Approximating covering problems by randomized search heuristics using multi-objective models
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Evolutionary algorithms and matroid optimization problems
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Worst-case and average-case approximations by simple randomized search heuristics
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
IEEE Transactions on Evolutionary Computation
Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions
IEEE Transactions on Evolutionary Computation
Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
On the size of weights in randomized search heuristics
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Evolutionary algorithms and dynamic programming
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Ant colony optimization and the minimum cut problem
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Illustration of fairness in evolutionary multi-objective optimization
Theoretical Computer Science
Evolutionary algorithms and dynamic programming
Theoretical Computer Science
On the approximation ability of evolutionary optimization with application to minimum set cover
Artificial Intelligence
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
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 bi-criteria approach based on the famous maximum-flow minimum-cut theorem that enables evolutionary algorithms to find an optimum solution in expected polynomial time.