Skip to main content

4 Result(s)

within Andrew M. Sutton Remove this filter Algorithm Analysis and Problem Complexity Remove this filter Theory of Computation Remove this filter

and

  1. No Access

    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...

    Andrew M. Sutton, Carsten Witt in Algorithmica (2021)

  2. No Access

    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 ...

    Andrew M. Sutton in Algorithmica (2021)

  3. No Access

    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 ...

    Benjamin Doerr, Frank Neumann, Andrew M. Sutton in Algorithmica (2017)

  4. No Access

    Article

    Superpolynomial Lower Bounds for the \((1+1)\) EA on Some Easy Combinatorial Problems

    The ( \(1+1\) 1 + ...

    Andrew M. Sutton in Algorithmica (2016)