{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T16:50:12Z","timestamp":1756572612176,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T00:00:00Z","timestamp":1624665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Australian Research Council","award":["DP190103894"],"award-info":[{"award-number":["DP190103894"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,26]]},"DOI":"10.1145\/3449639.3459363","type":"proceedings-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T17:50:43Z","timestamp":1624297843000},"page":"198-206","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Evolutionary diversity optimization and the minimum spanning tree problem"],"prefix":"10.1145","author":[{"given":"Jakob","family":"Bossek","sequence":"first","affiliation":[{"name":"University of M\u00fcnster, M\u00fcnster, Germany"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}]}],"member":"320","published-online":{"date-parts":[[2021,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071342"},{"volume-title":"Decomposition into cycles I: Hamilton decompositions","author":"Alspach Brian","key":"e_1_3_2_1_2_1","unstructured":"Brian Alspach , Jean-Claude Bermond , and Dominique Sotteau . 1990. Decomposition into cycles I: Hamilton decompositions . Springer Netherlands , 9--18. Brian Alspach, Jean-Claude Bermond, and Dominique Sotteau. 1990. Decomposition into cycles I: Hamilton decompositions. Springer Netherlands, 9--18."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321818"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340307"},{"edition":"2","volume-title":"Gary Chartrand and Linda Lesniak. 1986. Graphs & Digraphs","key":"e_1_3_2_1_5_1","unstructured":"Gary Chartrand and Linda Lesniak. 1986. Graphs & Digraphs ( 2 nd Ed.). Wadsworth Publ. Co., USA. Gary Chartrand and Linda Lesniak. 1986. Graphs & Digraphs (2nd Ed.). Wadsworth Publ. Co., USA."},{"key":"e_1_3_2_1_6_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein . 2001. Introduction to Algorithms ( 2 nd ed.). The MIT Press . Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2001. Introduction to Algorithms (2nd ed.). The MIT Press.","edition":"2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0187-y"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3389844"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29414-4"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00159"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45823-6_81"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598251"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739482.2764668"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.10069"},{"volume-title":"Analyzing Evolutionary Algorithms - The Computer Science Perspective","author":"Jansen Thomas","key":"e_1_3_2_1_15_1","unstructured":"Thomas Jansen . 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective . Springer . 1--236 pages. Thomas Jansen. 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective. Springer. 1--236 pages."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00242"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.21105\/joss.00135"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001606"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205532"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321796"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58112-1_28"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16544-3"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908961.2909000"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/364"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 28th International Conference on Neural Information Processing Systems -","volume":"1","author":"Qian Chao","year":"2015","unstructured":"Chao Qian , Yang Yu , and Zhi-Hua Zhou . 2015 . Subset Selection by Pareto Optimization . In Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 1 , NIPS 2015. 1774--1782. Chao Qian, Yang Yu, and Zhi-Hua Zhou. 2015. Subset Selection by Pareto Optimization. In Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 1, NIPS 2015. 1774--1782."},{"key":"e_1_3_2_1_28_1","volume-title":"R: A Language and Environment for Statistical Computing","author":"Team R Core","year":"2019","unstructured":"R Core Team . 2019 . R: A Language and Environment for Statistical Computing . R Foundation for Statistical Computing , Vienna, Austria . https:\/\/www.R-project.org\/ R Core Team. 2019. R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria. https:\/\/www.R-project.org\/"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.871251"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012354"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2008.16.4.557"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001665"}],"event":{"name":"GECCO '21: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lille France","acronym":"GECCO '21"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459363","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3449639.3459363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:09Z","timestamp":1750195689000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,26]]},"references-count":32,"alternative-id":["10.1145\/3449639.3459363","10.1145\/3449639"],"URL":"https:\/\/doi.org\/10.1145\/3449639.3459363","relation":{},"subject":[],"published":{"date-parts":[[2021,6,26]]},"assertion":[{"value":"2021-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}