47 citations · 86 across the 11 of their papers we have counts for
7 papers · 1 filter
Fixed-Parameter Tractability of the (1+1) Evolutionary Algorithm on Random Planted Vertex Covers
Jack Kearney, Frank Neumann, Andrew M. Sutton
We present the first parameterized analysis of a standard (1+1) Evolutionary Algorithm on a distribution of vertex cover problems. We show that if the planted cover is at most loga…
Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem
Denis Antipov, Aneta Neumann, Frank Neumann +1
Diversity optimization is the class of optimization problems in which we aim to find a diverse set of good solutions. One of the frequently-used approaches to solve such problems i…
Focused Jump-and-Repair Constraint Handling for Fixed-Parameter Tractable Graph Problems Closed Under Induced Subgraphs
Luke Branson, Andrew M. Sutton
Repair operators are often used for constraint handling in constrained combinatorial optimization. We investigate the (1+1)~EA equipped with a tailored jump-and-repair operation th…
Parameterized Complexity Analysis of Randomized Search Heuristics
Frank Neumann, Andrew M. Sutton
This chapter compiles a number of results that apply the theory of parameterized algorithmics to the running-time analysis of randomized search heuristics such as evolutionary algo…
Escaping Local Optima using Crossover with Emergent or Reinforced Diversity
Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing +5
Population diversity is essential for avoiding premature convergence in Genetic Algorithms (GAs) and for the effective use of crossover. Yet the dynamics of how diversity emerges i…
The Benefit of Sex in Noisy Evolutionary Search
Tobias Friedrich, Timo Kötzing, Martin Krejca +1
The benefit of sexual recombination is one of the most fundamental questions both in population genetics and evolutionary computation. It is widely believed that recombination help…
Parameterized Runtime Analyses of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem
Andrew M. Sutton, Frank Neumann
Parameterized runtime analysis seeks to understand the influence of problem structure on algorithmic runtime. In this paper, we contribute to the theoretical understanding of evolu…