Andrew M. Sutton, Carsten Witt. Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs. In Anne Auger, Thomas Stützle, editors, Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019, Prague, Czech Republic, July 13-17, 2019. pages 1515-1522, ACM, 2019. [doi]
@inproceedings{SuttonW19,
title = {Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs},
author = {Andrew M. Sutton and Carsten Witt},
year = {2019},
doi = {10.1145/3321707.3321848},
url = {https://doi.org/10.1145/3321707.3321848},
researchr = {https://researchr.org/publication/SuttonW19},
cites = {0},
citedby = {0},
pages = {1515-1522},
booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019, Prague, Czech Republic, July 13-17, 2019},
editor = {Anne Auger and Thomas Stützle},
publisher = {ACM},
isbn = {978-1-4503-6111-8},
}