{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T19:34:37Z","timestamp":1769974477545,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,1,14]],"date-time":"2010-01-14T00:00:00Z","timestamp":1263427200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s00453-010-9387-z","type":"journal-article","created":{"date-parts":[[2010,1,13]],"date-time":"2010-01-13T10:54:22Z","timestamp":1263380062000},"page":"369-386","source":"Crossref","is-referenced-by-count":103,"title":["Simplified Drift Analysis for Proving Lower Bounds in\u00a0Evolutionary Computation"],"prefix":"10.1007","volume":"59","author":[{"given":"Pietro S.","family":"Oliveto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,1,14]]},"reference":[{"issue":"4","key":"9387_CR1","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s00224-004-1177-z","volume":"39","author":"S. Droste","year":"2006","unstructured":"Droste, S., Jansen, T., Wegener, I.: Upper and lower bounds for randomized search heuristics in black-box optimization. Theory Comput. Syst. 39(4), 525\u2013544 (2006)","journal-title":"Theory Comput. Syst."},{"key":"9387_CR2","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1145\/1389095.1389276","volume-title":"Proc. of GECCO \u201908","author":"T. Friedrich","year":"2008","unstructured":"Friedrich, T., Oliveto, P.S., Sudholt, D., Witt, C.: Theoretical analysis of diversity mechanisms for global exploration. In: Proc. of GECCO \u201908, pp. 945\u2013952. ACM, New York (2008)"},{"issue":"2","key":"9387_CR3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/evco.1999.7.2.173","volume":"7","author":"J. Garnier","year":"1999","unstructured":"Garnier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutations. Evol. Comput. 7(2), 173\u2013203 (1999)","journal-title":"Evol. Comput."},{"key":"9387_CR4","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/3-540-36494-3_37","volume-title":"Proc. of STACS \u201903","author":"O. Giel","year":"2003","unstructured":"Giel, O., Wegener, I.: Evolutionary algorithms and the maximum matching problem. In: Proc. of STACS \u201903, pp. 415\u2013426. Springer, Berlin (2003)"},{"issue":"3","key":"9387_CR5","doi-asserted-by":"crossref","first-page":"502","DOI":"10.2307\/1426671","volume":"13","author":"B. Hajek","year":"1982","unstructured":"Hajek, B.: Hitting-time and occupation-time bounds implied by drift analysis with applications. Adv. Appl. Probab. 13(3), 502\u2013525 (1982)","journal-title":"Adv. Appl. Probab."},{"key":"9387_CR6","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1145\/1389095.1389277","volume-title":"Proc. of GECCO \u201908","author":"E. Happ","year":"2008","unstructured":"Happ, E., Johannsen, D., Klein, C., Neumann, F.: Rigorous analyses of fitness-proportional selection for optimizing linear functions. In: Proc. of GECCO \u201908, pp. 953\u2013960. ACM, New York (2008)"},{"issue":"1","key":"9387_CR7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J. He","year":"2001","unstructured":"He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artif. Intell. 127(1), 57\u201385 (2001)","journal-title":"Artif. Intell."},{"issue":"1","key":"9387_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/B:NACO.0000023417.31393.c7","volume":"3","author":"J. He","year":"2004","unstructured":"He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Nat. Comput. 3(1), 21\u201335 (2004)","journal-title":"Nat. Comput."},{"key":"9387_CR9","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1145\/1569901.1570016","volume-title":"Proc. of GECCO \u201909","author":"F. Neumann","year":"2009","unstructured":"Neumann, F., Oliveto, P.S., Witt, C.: Theoretical analysis of fitness-proportional selection: landscapes and efficiency. In: Proc. of GECCO \u201909, pp. 835\u2013842. ACM, New York (2009)"},{"key":"9387_CR10","series-title":"LNCS","first-page":"82","volume-title":"Proc. of PPSN\u201908","author":"P.S. Oliveto","year":"2008","unstructured":"Oliveto, P.S., Witt, C.: Simplified drift analysis for proving lower bounds in evolutionary computation. In: Proc. of PPSN\u201908. LNCS, vol. 5199, pp. 82\u201391. Springer, Berlin (2008)"},{"key":"9387_CR11","doi-asserted-by":"crossref","unstructured":"Oliveto, P.S., He, J., Yao, X.: Evolutionary algorithms and the vertex cover problem. In: Proc. of CEC \u201907, pp. 1430\u20131438 (2007)","DOI":"10.1109\/CEC.2007.4424701"},{"issue":"3","key":"9387_CR12","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s11633-007-0281-3","volume":"4","author":"P.S. Oliveto","year":"2007","unstructured":"Oliveto, P.S., He, J., Yao, X.: Time complexity of evolutionary algorithms for combinatorial optimization: a decade of results. Int. J. Autom. Comput. 4(3), 281\u2013293 (2007)","journal-title":"Int. J. Autom. Comput."},{"issue":"2","key":"9387_CR13","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1145\/42282.46160","volume":"35","author":"G.H. Sasaki","year":"1988","unstructured":"Sasaki, G.H., Hajek, B.: The time complexity of maximum matching by simulated annealing. J. Assoc. Comput. Mach. 35(2), 387\u2013403 (1988)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9387_CR14","volume-title":"Evolutionary Optimization","author":"I. Wegener","year":"2001","unstructured":"Wegener, I.: Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In: Sarker, R., Mohammadian, M., Yao, X. (eds.) Evolutionary Optimization. Kluwer Academic, Dordrecht (2001)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9387-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9387-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9387-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:05Z","timestamp":1559123105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9387-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,14]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9387"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9387-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,14]]}}}