{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:12:28Z","timestamp":1750219948628,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T00:00:00Z","timestamp":1693353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP190103894 and FT200100536"],"award-info":[{"award-number":["DP190103894 and FT200100536"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,30]]},"DOI":"10.1145\/3594805.3607135","type":"proceedings-article","created":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T11:03:28Z","timestamp":1690801408000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7906-096X","authenticated-orcid":false,"given":"Denis","family":"Antipov","sequence":"first","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0036-4782","authenticated-orcid":false,"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2721-3618","authenticated-orcid":false,"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,8,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TG.2020.3046133"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459364"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459363"},{"key":"e_1_3_2_1_4_1","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","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. Escaping local optima with diversity mechanisms and crossover. In Genetic and Evolutionary Computation Conference, GECCO 2016. ACM, 645--652."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2724201"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3389844"},{"key":"e_1_3_2_1_7_1","article-title":"Analysis of Evolutionary Diversity Optimization for Permutation Problems","volume":"2","author":"Do Anh Viet","year":"2022","unstructured":"Anh Viet Do, Mingyu Guo, Aneta Neumann, and Frank Neumann. 2022. Analysis of Evolutionary Diversity Optimization for Permutation Problems. ACM Transactions on Evolutionary Learning and Optimisation 2, 3 (2022), 11:1--11:27.","journal-title":"ACM Transactions on Evolutionary Learning and Optimisation"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908827"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i7.16740"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00274"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00013"},{"key":"e_1_3_2_1_12_1","volume-title":"PPSN","author":"Hagg Alexander","year":"2018","unstructured":"Alexander Hagg, Alexander Asteroth, and Thomas B\u00e4ck. 2018. Prototype discovery using quality-diversity. In Parallel Problem Solving from Nature, PPSN 2018, Part I. Springer, 500--511."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2020.103710"},{"key":"e_1_3_2_1_14_1","volume-title":"International Conference on the Synthesis and Simulation of Living Systems, ALIFE","author":"Lehman Joel","year":"2008","unstructured":"Joel Lehman and Kenneth O. Stanley. 2008. Exploiting open-endedness to solve problems through the search for novelty. In International Conference on the Synthesis and Simulation of Living Systems, ALIFE 2008. MIT Press, 329--336."},{"key":"e_1_3_2_1_15_1","volume-title":"Illuminating search spaces by mapping elites. CoRR abs\/1504.04909","author":"Mouret Jean-Baptiste","year":"2015","unstructured":"Jean-Baptiste Mouret and Jeff Clune. 2015. Illuminating search spaces by mapping elites. CoRR abs\/1504.04909 (2015). arXiv:1504.04909"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528755"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459385"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205532"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321796"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590405"},{"key":"e_1_3_2_1_21_1","first-page":"1","article-title":"Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation. In Foundations of Genetic Algorithms, FOGA 2021","volume":"9","author":"Nikfarjam Adel","year":"2021","unstructured":"Adel Nikfarjam, Jakob Bossek, Aneta Neumann, and Frank Neumann. 2021. Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation. In Foundations of Genetic Algorithms, FOGA 2021. ACM, 9:1--9:11.","journal-title":"ACM"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459384"},{"key":"e_1_3_2_1_23_1","volume-title":"PPSN","author":"Nikfarjam Adel","year":"2022","unstructured":"Adel Nikfarjam, Anh Viet Do, and Frank Neumann. 2022. Analysis of quality diversity algorithms for the knapsack problem. In Parallel Problem Solving from Nature, PPSN 2022, Part II. Springer, 413--427."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459320"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001665"}],"event":{"name":"FOGA '23: Foundations of Genetic Algorithms XVII","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Potsdam Germany","acronym":"FOGA '23"},"container-title":["Proceedings of the 17th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3594805.3607135","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3594805.3607135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:01Z","timestamp":1750182541000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3594805.3607135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,30]]},"references-count":25,"alternative-id":["10.1145\/3594805.3607135","10.1145\/3594805"],"URL":"https:\/\/doi.org\/10.1145\/3594805.3607135","relation":{},"subject":[],"published":{"date-parts":[[2023,8,30]]},"assertion":[{"value":"2023-08-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}