{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:02:06Z","timestamp":1750309326040,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T00:00:00Z","timestamp":1720915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"FMJH Program PGMO"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,14]]},"DOI":"10.1145\/3638530.3664065","type":"proceedings-article","created":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T14:54:43Z","timestamp":1722524083000},"page":"35-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Runtime Analysis of the (\u03bc + 1) GA: Provable Speed-Ups from Strong Drift towards Diverse Populations"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9786-220X","authenticated-orcid":false,"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"},{"name":"LIX, CNRS, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-5061-4623","authenticated-orcid":false,"given":"Aymen","family":"Echarghaoui","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-3133-3368","authenticated-orcid":false,"given":"Mohammed","family":"Jamal","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1765-1219","authenticated-orcid":false,"given":"Martin S.","family":"Krejca","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"},{"name":"LIX, CNRS, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Anne Auger and Benjamin Doerr (Eds.). 2011. Theory of Randomized Search Heuristics. World Scientific Publishing.","DOI":"10.1142\/7438"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2724201"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26460"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i18.30055"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.10.035"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Benjamin Doerr and Frank Neumann (Eds.). 2020. Theory of Evolutionary Computation---Recent Developments in Discrete Optimization. Springer.","DOI":"10.1007\/978-3-030-29414-4"},{"volume-title":"Adaptation in Natural and Artificial Systems","author":"Holland John H.","key":"e_1_3_2_1_7_1","unstructured":"John H. Holland. 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press."},{"volume-title":"Analyzing Evolutionary Algorithms - The Computer Science Perspective","author":"Jansen Thomas","key":"e_1_3_2_1_8_1","unstructured":"Thomas Jansen. 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective. Springer."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0940-2"},{"key":"e_1_3_2_1_10_1","volume-title":"NIPS","author":"Mitchell Melanie","year":"1993","unstructured":"Melanie Mitchell, John H. Holland, and Stephanie Forrest. 1993. When will a genetic algorithm outperform hill climbing. In Advances in Neural Information Processing Systems, NIPS 1993. Morgan Kaufmann, 51--58."},{"volume-title":"Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity","author":"Neumann Frank","key":"e_1_3_2_1_11_1","unstructured":"Frank Neumann and Carsten Witt. 2010. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer."},{"key":"e_1_3_2_1_12_1","volume-title":"CoRR abs\/2404.07061","author":"Opris Andre","year":"2024","unstructured":"Andre Opris, Johannes Lengler, and Dirk Sudholt. 2024. A Tight O(4k\/pc) Runtime Bound for a (\u03bc + 1) GA on Jumpk for Realistic Crossover Probabilities. CoRR abs\/2404.07061 (2024). To be published at GECCO 2024."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-5956-9"}],"event":{"name":"GECCO '24 Companion: Genetic and Evolutionary Computation Conference Companion","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Melbourne VIC Australia","acronym":"GECCO '24 Companion"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638530.3664065","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638530.3664065","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:04:02Z","timestamp":1750291442000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638530.3664065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":13,"alternative-id":["10.1145\/3638530.3664065","10.1145\/3638530"],"URL":"https:\/\/doi.org\/10.1145\/3638530.3664065","relation":{},"subject":[],"published":{"date-parts":[[2024,7,14]]},"assertion":[{"value":"2024-08-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}