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 multi-start ( μ +1) GA solves arbitrary length- n instances of closest string in 2 O (...

Ausführliche Beschreibung