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

Andrew M. Sutton, Carsten Witt. Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs. Algorithmica, 83(10):3180-3208, 2021. [doi]

@article{SuttonW21,
  title = {Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs},
  author = {Andrew M. Sutton and Carsten Witt},
  year = {2021},
  doi = {10.1007/s00453-020-00776-6},
  url = {https://doi.org/10.1007/s00453-020-00776-6},
  researchr = {https://researchr.org/publication/SuttonW21},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {83},
  number = {10},
  pages = {3180-3208},
}