{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T12:19:01Z","timestamp":1763727541325,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T00:00:00Z","timestamp":1566864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Natural Science Foundation of China","award":["61802441, 61672536"],"award-info":[{"award-number":["61802441, 61672536"]}]},{"name":"Australian Research Council","award":["DP160102401"],"award-info":[{"award-number":["DP160102401"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,8,27]]},"DOI":"10.1145\/3299904.3340314","type":"proceedings-article","created":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T19:43:29Z","timestamp":1566243809000},"page":"133-146","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem"],"prefix":"10.1145","author":[{"given":"Feng","family":"Shi","sequence":"first","affiliation":[{"name":"Central South University, Changsha, China"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[{"name":"Central South University, Changsha, China"}]}],"member":"320","published-online":{"date-parts":[[2019,8,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.1999.tb00176.x"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00376-1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.06.025"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109627"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90039-2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"volume-title":"Introduction to algorithms","author":"Cormen Thomas H","key":"e_1_3_2_1_7_1","unstructured":"Thomas H Cormen , Charles E Leiserson , Ronald L Rivest , and Clifford Stein . 2009. Introduction to algorithms . MIT press . Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. 2009. Introduction to algorithms. MIT press."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463442"},{"volume-title":"Parameterized algorithms","author":"Cygan Marek","key":"e_1_3_2_1_9_1","unstructured":"Marek Cygan , Fedor V Fomin , \u0141ukasz Kowalik , Daniel Lokshtanov , D\u00e1niel Marx , Marcin Pilipczuk , Micha\u0142 Pilipczuk , and Saket Saurabh . 2015. Parameterized algorithms . Vol. 4 . Springer . Marek Cygan, Fedor V Fomin, \u0141ukasz Kowalik, Daniel Lokshtanov, D\u00e1niel Marx, Marcin Pilipczuk, Micha\u0142 Pilipczuk, and Saket Saurabh. 2015. Parameterized algorithms. Vol. 4. Springer."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9622-x"},{"volume-title":"Parameterized complexity","author":"Downey Rodney G","key":"e_1_3_2_1_11_1","unstructured":"Rodney G Downey and Michael Ralph Fellows . 2012. Parameterized complexity . Springer Science & Business Media . Rodney G Downey and Michael Ralph Fellows. 2012. Parameterized complexity. Springer Science & Business Media."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00003"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12598-1_40"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144185"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:NACO.0000023417.31393.c7"},{"key":"e_1_3_2_1_16_1","volume-title":"O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. Pr\u00e1ca Moravsk\u00e9 Pr\u00edrodovedeck\u00e9 Spolecnosti 6","author":"Jarn\u00edk Vojt\u011bch","year":"1930","unstructured":"Vojt\u011bch Jarn\u00edk . 1930. O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. Pr\u00e1ca Moravsk\u00e9 Pr\u00edrodovedeck\u00e9 Spolecnosti 6 ( 1930 ), 57--63. Vojt\u011bch Jarn\u00edk. 1930. O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. Pr\u00e1ca Moravsk\u00e9 Pr\u00edrodovedeck\u00e9 Spolecnosti 6 (1930), 57--63."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1885031.1885054"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9660-4"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00199"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.08.005"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99259-4_12"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-006-9004-x"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.002"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.02.012"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence. 3742--3748","author":"Neumann Frank","year":"2015","unstructured":"Frank Neumann and Carsten Witt . 2015 . On the runtime of randomized local search and simple evolutionary algorithms for dynamic makespan scheduling . In Proceedings of the International Joint Conference on Artificial Intelligence. 3742--3748 . Frank Neumann and Carsten Witt. 2015. On the runtime of randomized local search and simple evolutionary algorithms for dynamic makespan scheduling. In Proceedings of the International Joint Conference on Artificial Intelligence. 3742--3748."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2781820.2781821"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3040718.3040726"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45823-6_68"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/952532.952678"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99253-2_13"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205580"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0451-4"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32937-1_6"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00119"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908862"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.01.001"}],"event":{"name":"FOGA '19: Foundations of Genetic Algorithms XV","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Potsdam Germany","acronym":"FOGA '19"},"container-title":["Proceedings of the 15th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299904.3340314","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299904.3340314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:39Z","timestamp":1750204419000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299904.3340314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,27]]},"references-count":37,"alternative-id":["10.1145\/3299904.3340314","10.1145\/3299904"],"URL":"https:\/\/doi.org\/10.1145\/3299904.3340314","relation":{},"subject":[],"published":{"date-parts":[[2019,8,27]]},"assertion":[{"value":"2019-08-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}