{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T12:12:15Z","timestamp":1763727135254,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,12]],"date-time":"2017-01-12T00:00:00Z","timestamp":1484179200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,1,12]]},"DOI":"10.1145\/3040718.3040726","type":"proceedings-article","created":{"date-parts":[[2017,4,5]],"date-time":"2017-04-05T12:47:40Z","timestamp":1491396460000},"page":"37-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms"],"prefix":"10.1145","author":[{"given":"Mojgan","family":"Pourhassan","sequence":"first","affiliation":[{"name":"University of Adelaide, Adelaide, Australia"}]},{"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"University of Adelaide, Adelaide, Australia"}]}],"member":"320","published-online":{"date-parts":[[2017,1,12]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1109\/SFCS.1979.34"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1142\/7438"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1016\/0196-6774(81)90020-1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1023\/A:1015059928466"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1007\/978-3-642-15844-5_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1016\/0020-0190(83)90007-8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1007\/978-3-319-45823-6_75"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/2739480.2754684"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/2908812.2908891"},{"key":"e_1_3_2_1_10_1","first-page":"824","volume-title":"Proceedings","author":"Doerr B.","year":"2016","unstructured":"B. Doerr , C. Doerr , and J. Yang . k-bit mutation with self-adjusting k outperforms standard bit mutation. In Parallel Problem Solving from Nature -- PPSN XIV: 14th International Conference, Edinburgh, UK, September 17--21, 2016 , Proceedings , pages 824 -- 834 . Springer International Publishing , 2016 . B. Doerr, C. Doerr, and J. Yang. k-bit mutation with self-adjusting k outperforms standard bit mutation. In Parallel Problem Solving from Nature -- PPSN XIV: 14th International Conference, Edinburgh, UK, September 17--21, 2016, Proceedings, pages 824--834. Springer International Publishing, 2016."},{"unstructured":"B. Doerr D. Johannsen and M. Schmidt. Runtime analysis of the (1  B. Doerr D. Johannsen and M. Schmidt. Runtime analysis of the (1","key":"e_1_3_2_1_11_1"},{"key":"e_1_3_2_1_12_1","first-page":"119","volume-title":"Workshop on Foundations of Genetic Algorithms (FOGA)","year":"2011","unstructured":"1 ) evolutionary algorithm on strings over finite alphabets . In Workshop on Foundations of Genetic Algorithms (FOGA) , pages 119 -- 126 , 2011 . 1) evolutionary algorithm on strings over finite alphabets. In Workshop on Foundations of Genetic Algorithms (FOGA), pages 119--126, 2011."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1007\/s00453-012-9622-x"},{"unstructured":"B. Doerr and S. Pohl. Run-time analysis of the (1  B. Doerr and S. Pohl. Run-time analysis of the (1","key":"e_1_3_2_1_14_1"},{"key":"e_1_3_2_1_15_1","first-page":"1317","volume-title":"Genetic and Evolutionary Computation Conference (GECCO)","year":"2012","unstructured":"1 ) evolutionary algorithm optimizing linear functions over a finite alphabet . In Genetic and Evolutionary Computation Conference (GECCO) , pages 1317 -- 1324 , 2012 . 1) evolutionary algorithm optimizing linear functions over a finite alphabet. In Genetic and Evolutionary Computation Conference (GECCO), pages 1317--1324, 2012."},{"key":"e_1_3_2_1_16_1","volume-title":"Design and Analysis of Approximation Algorithms","author":"Du D.-Z.","year":"2011","unstructured":"D.-Z. Du , K.-I. Ko , and X. Hu . Design and Analysis of Approximation Algorithms . Springer Publishing Company, Inc orporated, 2011 . D.-Z. Du, K.-I. Ko, and X. Hu. Design and Analysis of Approximation Algorithms. Springer Publishing Company, Incorporated, 2011."},{"key":"e_1_3_2_1_17_1","series-title":"Studies in Computational Intelligence","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-540-69432-8_2","volume-title":"Parameter Setting in Evolutionary Algorithms","author":"Eiben A. E.","year":"2007","unstructured":"A. E. Eiben , Z. Michalewicz , M. Schoenauer , and J. E. Smith . Parameter control in evolutionary algorithms . In Parameter Setting in Evolutionary Algorithms , volume 54 of Studies in Computational Intelligence , pages 19 -- 46 . Springer , 2007 . A. E. Eiben, Z. Michalewicz, M. Schoenauer, and J. E. Smith. Parameter control in evolutionary algorithms. In Parameter Setting in Evolutionary Algorithms, volume 54 of Studies in Computational Intelligence, pages 19--46. Springer, 2007."},{"key":"e_1_3_2_1_18_1","volume-title":"An Introduction to Probability Theory and Its Applications","author":"Feller W.","year":"1968","unstructured":"W. Feller . An Introduction to Probability Theory and Its Applications , volume 1 . Wiley , 3 rd edition, 1968 . W. Feller. An Introduction to Probability Theory and Its Applications, volume 1. Wiley, 3rd edition, 1968.","edition":"3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1162\/evco.2009.17.1.3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1162\/EVCO_a_00003"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1162\/106365603321828970"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/1389095.1389277"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1016\/S0004-3702(01)00058-3"},{"key":"e_1_3_2_1_24_1","series-title":"Natural Computing Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-17339-4","volume-title":"Analyzing Evolutionary Algorithms -- The Computer Science Perspective","author":"Jansen T.","year":"2013","unstructured":"T. Jansen . Analyzing Evolutionary Algorithms -- The Computer Science Perspective . Natural Computing Series . Springer , 2013 . T. Jansen. Analyzing Evolutionary Algorithms -- The Computer Science Perspective. Natural Computing Series. Springer, 2013."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/2460239.2460248"},{"unstructured":"T. K\u00f6tzing A. Lissovoi and C. Witt. (1  T. K\u00f6tzing A. Lissovoi and C. Witt. (1","key":"e_1_3_2_1_26_1"},{"key":"e_1_3_2_1_27_1","first-page":"40","volume-title":"Workshop on Foundations of Genetic Algorithms (FOGA)","year":"2015","unstructured":"1 ) EA on generalized dynamic onemax . In Workshop on Foundations of Genetic Algorithms (FOGA) , pages 40 -- 51 , 2015 . 1) EA on generalized dynamic onemax. In Workshop on Foundations of Genetic Algorithms (FOGA), pages 40--51, 2015."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1007\/s00453-012-9660-4"},{"key":"e_1_3_2_1_29_1","volume-title":"Adaptive population models for offspring populations and parallel evolutionary algorithms. Technical report, https:\/\/arxiv.org\/abs\/1102.0588","author":"L\u00e4ssig J.","year":"2011","unstructured":"J. L\u00e4ssig and D. Sudholt . Adaptive population models for offspring populations and parallel evolutionary algorithms. Technical report, https:\/\/arxiv.org\/abs\/1102.0588 , 2011 . J. L\u00e4ssig and D. Sudholt. Adaptive population models for offspring populations and parallel evolutionary algorithms. Technical report, https:\/\/arxiv.org\/abs\/1102.0588, 2011."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1007\/978-3-642-16544-3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1007\/s00453-010-9387-z"},{"key":"e_1_3_2_1_32_1","volume-title":"Erratum: Simplified drift analysis for proving lower bounds in evolutionary computation. arXiv, abs\/1211.7184","author":"Oliveto P.","year":"2012","unstructured":"P. Oliveto and C. Witt . Erratum: Simplified drift analysis for proving lower bounds in evolutionary computation. arXiv, abs\/1211.7184 , 2012 . P. Oliveto and C. Witt. Erratum: Simplified drift analysis for proving lower bounds in evolutionary computation. arXiv, abs\/1211.7184, 2012."},{"unstructured":"P. S. Oliveto J. He and X. Yao. Analysis of the (1  P. S. Oliveto J. He and X. Yao. Analysis of the (1","key":"e_1_3_2_1_33_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1109\/TEVC.2009.2014362"},{"key":"e_1_3_2_1_35_1","volume-title":"Approximation Algorithms","author":"Vazirani V. V.","year":"2001","unstructured":"V. V. Vazirani . Approximation Algorithms . Springer-Verlag New York, Inc. , New York, NY, USA , 2001 . V. V. Vazirani. Approximation Algorithms. Springer-Verlag New York, Inc., New York, NY, USA, 2001."},{"key":"e_1_3_2_1_36_1","first-page":"349","volume-title":"Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions","author":"Wegener I.","year":"2002","unstructured":"I. Wegener . Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions , pages 349 -- 369 . Springer US , Boston, MA , 2002 . I. Wegener. Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions, pages 349--369. Springer US, Boston, MA, 2002."}],"event":{"sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"acronym":"FOGA '17","name":"FOGA '17: Foundations of Genetic Algorithms XIV","location":"Copenhagen Denmark"},"container-title":["Proceedings of the 14th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3040718.3040726","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3040718.3040726","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:57Z","timestamp":1750273497000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3040718.3040726"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,12]]},"references-count":36,"alternative-id":["10.1145\/3040718.3040726","10.1145\/3040718"],"URL":"https:\/\/doi.org\/10.1145\/3040718.3040726","relation":{},"subject":[],"published":{"date-parts":[[2017,1,12]]},"assertion":[{"value":"2017-01-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}