Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs.

Andrew M. Sutton Carsten Witt

Published in: Algorithmica (2021)

Keyphrases

lower bound
graph theory
worst case
upper and lower bounds
input output
computational complexity
special case
upper bound
genetic algorithm
theoretical analysis
data structure
np hard
genetic programming
times faster
error bounds
graph matching
objective function
learning algorithm