-
Article
Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs
The runtime analysis of evolutionary algorithms using crossover as search operator has recently produced remarkable results indicating benefits and drawbacks of crossover and illustrating its working principle...
-
Article
Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem
We investigate the effect of crossover in the context of parameterized complexity on a well-known fixed-parameter tractable combinatorial optimization problem known as the closest string problem. We prove that a ...
-
Chapter and Conference Paper
Symmetry Breaking for Voting Mechanisms
Recently, Rowe and Aishwaryaprajna [FOGA 2019] introduced a simple majority vote technique that efficiently solves Jump with large gaps, OneMax with large noise, and any monotone function with a polynomial-size i...
-
Chapter and Conference Paper
Approximation Speed-Up by Quadratization on LeadingOnes
We investigate the quadratization of LeadingOnes in the context of the landscape for local search. We prove that a standard quadratization (i.e., its expression as a degree-2 multilinear polynomial) of LeadingOne...
-
Article
Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas
We contribute to the theoretical understanding of randomized search heuristics by investigating their optimization behavior on satisfiable random k-satisfiability instances both in the planted solution model and ...
-
Article
Superpolynomial Lower Bounds for the \((1+1)\) EA on Some Easy Combinatorial Problems
The ( \(1+1\) 1 + ...