{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:25:42Z","timestamp":1759177542962,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","funder":[{"name":"Swiss National Science Foundation","award":["10003390"],"award-info":[{"award-number":["10003390"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,27]]},"DOI":"10.1145\/3729878.3746613","type":"proceedings-article","created":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T13:47:17Z","timestamp":1755611237000},"page":"154-165","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Diversity-Preserving Exploitation of Crossover"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0004-7629","authenticated-orcid":false,"given":"Johannes","family":"Lengler","sequence":"first","affiliation":[{"name":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-2714-0245","authenticated-orcid":false,"given":"Tom","family":"Offermann","sequence":"additional","affiliation":[{"name":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2025,8,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2019.01.007"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-70071-2_7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00743-1"},{"key":"e_1_3_2_1_4_1","volume-title":"Exploration and exploitation in evolutionary algorithms: A survey. ACM computing surveys (CSUR) 45, 3","author":"\u010crepin\u0161ek Matej","year":"2013","unstructured":"Matej \u010crepin\u0161ek, Shih-Hsi Liu, and Marjan Mernik. 2013. Exploration and exploitation in evolutionary algorithms: A survey. ACM computing surveys (CSUR) 45, 3 (2013), 1--33."},{"key":"e_1_3_2_1_5_1","volume-title":"Pietro S Oliveto, Dirk Sudholt, and Andrew M Sutton.","author":"Dang Duc-Cuong","year":"2016","unstructured":"Duc-Cuong Dang, Tobias Friedrich, Timo K\u00f6tzing, Martin S Krejca, Per Kristian Lehre, Pietro S Oliveto, Dirk Sudholt, and Andrew M Sutton. 2016. Emergence of diversity and its benefits for crossover in genetic algorithms. In Parallel Problem Solving from Nature (PPSN 2016). Springer, Cham, 890--900."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2724201"},{"volume-title":"Theory of evolutionary computation: Recent developments in discrete optimization","author":"Doerr Benjamin","key":"e_1_3_2_1_7_1","unstructured":"Benjamin Doerr. 2020. Probabilistic tools for the analysis of randomized optimization heuristics. In Theory of evolutionary computation: Recent developments in discrete optimization. Springer, Cham, 1--87."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0354-9"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.028"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00854-3"},{"key":"e_1_3_2_1_11_1","volume-title":"AAAI Conference on Artificial Intelligence (AAAI 2024","volume":"38","author":"Doerr Benjamin","year":"2024","unstructured":"Benjamin Doerr, Aymen Echarghaoui, Mohammed Jamal, and Martin S Krejca. 2024. Runtime Analysis of the (μ+ 1) GA: Provable Speed-Ups from Strong Drift towards Diverse Populations. In AAAI Conference on Artificial Intelligence (AAAI 2024), Vol. 38. ACM, New York, 20683--20691."},{"key":"e_1_3_2_1_12_1","volume-title":"Markus Wagner, and Carola Winzen.","author":"Doerr Benjamin","year":"2011","unstructured":"Benjamin Doerr, Daniel Johannsen, Timo K\u00f6tzing, Per Kristian Lehre, Markus Wagner, and Carola Winzen. 2011. Faster black-box algorithms through higher arity operators. In Foundations of Genetic Algorithms (FOGA 2011). ACM, New York, 163--172."},{"key":"e_1_3_2_1_13_1","first-page":"1483","article-title":"Significance-based estimation-of-distribution algorithms","volume":"24","author":"Doerr Benjamin","year":"2020","unstructured":"Benjamin Doerr and Martin Krejca. 2020. Significance-based estimation-of-distribution algorithms. IEEE Transactions on Evolutionary Computation 24, 6 (2020), 1483--1490.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"},{"key":"e_1_3_2_1_15_1","volume-title":"Artificial Evolution (EA","author":"Doerr Benjamin","year":"2011","unstructured":"Benjamin Doerr and Carola Winzen. 2012. Black-box complexity: Breaking the O (n log n) barrier of LeadingOnes. In Artificial Evolution (EA 2011). Springer, Cham, 205--216."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00195"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0304-6"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0940-2"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.02.019"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176346079"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001711"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9616-8"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Johannes Lengler and Tom Offermann. 2025. Diversity-Preserving Exploitation of Crossover. arXiv:2507.01524 https:\/\/arxiv.org\/abs\/2507.01524","DOI":"10.1145\/3729878.3746613"},{"key":"e_1_3_2_1_25_1","volume-title":"Genetic and Evolutionary Computation Conference (GECCO","author":"Lengler Johannes","year":"2024","unstructured":"Johannes Lengler, Andre Opris, and Dirk Sudholt. 2024. A Tight O (4k \/ pc) Runtime Bound for a (μ + 1) GA on Jumpk for Realistic Crossover Probabilities. In Genetic and Evolutionary Computation Conference (GECCO 2024). ACM, New York, 1605--1613."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-024-01226-3"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1997.5.3.303"},{"volume-title":"Convergence properties of evolutionary algorithms","author":"Rudolph G\u00fcnter","key":"e_1_3_2_1_28_1","unstructured":"G\u00fcnter Rudolph. 1997. Convergence properties of evolutionary algorithms. Verlag Dr. Kova\u010d, Hamburg."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330260"},{"key":"e_1_3_2_1_30_1","volume-title":"How crossover speeds up building block assembly in genetic algorithms. Evolutionary computation 25, 2","author":"Sudholt Dirk","year":"2017","unstructured":"Dirk Sudholt. 2017. How crossover speeds up building block assembly in genetic algorithms. Evolutionary computation 25, 2 (2017), 237--274."},{"volume-title":"Theory of evolutionary computation: Recent developments in discrete optimization","author":"Sudholt Dirk","key":"e_1_3_2_1_31_1","unstructured":"Dirk Sudholt. 2020. The benefits of population diversity in evolutionary algorithms: a survey of rigorous runtime analyses. In Theory of evolutionary computation: Recent developments in discrete optimization. Springer, Cham, 359--404."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00809-8"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3510426"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860734-7\/50087-1"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277224"},{"volume-title":"Handbook of Metaheuristics","author":"Whitley Darrell","key":"e_1_3_2_1_36_1","unstructured":"Darrell Whitley. 2019. Next generation genetic algorithms: a user's guide and tutorial. In Handbook of Metaheuristics. Springer, Cham, 245--274."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99259-4_5"}],"event":{"name":"FOGA '25: Foundations of Genetic Algorithms XVIII","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Leiden Netherlands","acronym":"FOGA '25"},"container-title":["Proceedings of the 18th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3729878.3746613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T16:25:01Z","timestamp":1759163101000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3729878.3746613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,27]]},"references-count":37,"alternative-id":["10.1145\/3729878.3746613","10.1145\/3729878"],"URL":"https:\/\/doi.org\/10.1145\/3729878.3746613","relation":{},"subject":[],"published":{"date-parts":[[2025,8,27]]},"assertion":[{"value":"2025-08-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}