{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:11Z","timestamp":1760202611091},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540006237"},{"type":"electronic","value":"9783540364948"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36494-3_37","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:12:04Z","timestamp":1269897124000},"page":"415-426","source":"Crossref","is-referenced-by-count":72,"title":["Evolutionary Algorithms and the Maximum Matching Problem"],"prefix":"10.1007","author":[{"given":"Oliver","family":"Giel","sequence":"first","affiliation":[]},{"given":"Ingo","family":"Wegener","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,17]]},"reference":[{"key":"37_CR1","unstructured":"N. Blum. A simplified realization of the Hopcroft-Karp approach to maximum matching in general graphs. Technical report, Universit\u00e4t Bonn, 1999."},{"key":"37_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0056845","volume-title":"On the optimization of unimodal functions with the (1+1) evolutionary algorithm","author":"S. Droste","year":"1998","unstructured":"S. Droste, T. Jansen, and I. Wegener. On the optimization of unimodal functions with the (1+1) evolutionary algorithm. In Proc. of the 5th Conf. on Parallel Problem Solving from Nature (PPSN V), LNCS 1498, pages 13\u201322, 1998."},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S. Droste","year":"2002","unstructured":"S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51\u201382, 2002.","journal-title":"Theoretical Computer Science"},{"key":"37_CR4","unstructured":"W. Feller. An Introduction to Probability Theory and Its Applications. Wiley, 1971."},{"key":"37_CR5","unstructured":"O. Giel and I. Wegener. Evolutionary algorithms and the maximum matching problem. Technical Report CI 142\/02, Universit\u00e4t Dortmund, SFB 531, 2002. http:\/\/ls2-www.cs.uni-dortmund.de\/~wegener\/papers\/Matchings.ps ."},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"502","DOI":"10.2307\/1426671","volume":"14","author":"B. Hajek","year":"1982","unstructured":"B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied Probability, 14:502\u2013525, 1982.","journal-title":"Advances in Applied Probability"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J. He","year":"2001","unstructured":"J. He and X. Yao. Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence, 127:57\u201385, 2001.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"37_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"J. E. Hopcroft and R. M. Karp. An n5\/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4):225\u2013231, 1973.","journal-title":"SIAM Journal on Computing"},{"key":"37_CR9","unstructured":"T. Jansen and I. Wegener. Real royal road functions-where crossover provably is essential. In Proc. of the 3rd Genetic and Evolutionary Computation Conference (GECCO 2001), pages 375\u2013382, 2001."},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00453-002-0940-2","volume":"34","author":"T. Jansen","year":"2002","unstructured":"T. Jansen and I. Wegener. The analysis of evolutionary algorithms-a proof that crossover really can help. Algorithmica, 34:47\u201366, 2002.","journal-title":"Algorithmica"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"S. Micali and V. V. Vazirani. An O(\u221aV. E) algorithm for finding maximum matching in general graphs. In Proc. 21st Annual Symp. on Foundations of Computer Science (FOCS), pages 17\u201327, 1980.","DOI":"10.1109\/SFCS.1980.12"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1145\/42282.46160","volume":"35","author":"G. H. Sasaki","year":"1988","unstructured":"G. H. Sasaki and B. Hajek. The time complexity of maximum matching by simulated annealing. Journal of the ACM, 35:387\u2013403, 1988.","journal-title":"Journal of the ACM"},{"key":"37_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/3-540-45712-7_6","volume-title":"Fitness landscapes based on sorting and shortest paths problems","author":"J. Scharnow","year":"2002","unstructured":"J. Scharnow, K. Tinnefeld, and I. Wegener. Fitness landscapes based on sorting and shortest paths problems. In Proc. of the 7th Conf. on Parallel Problem Solving from Nature (PPSN VII), LNCS 2439, pages 54\u201363, 2002."},{"issue":"1","key":"37_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF01305952","volume":"14","author":"V. V. Vazirani","year":"1994","unstructured":"V. V. Vazirani. A theory of alternating paths and blossoms for proving correctness of the O(\u221aV E) maximum matching algorithm. Combinatorica, 14(1):71\u2013109, 1994.","journal-title":"Combinatorica"},{"key":"37_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/3-540-48224-5_6","volume-title":"Theoretical aspects of evolutionary algorithms","author":"I. Wegener","year":"2001","unstructured":"I. Wegener. Theoretical aspects of evolutionary algorithms. In Proc. of the 28th Internat. Colloq. on Automata, Languages and Programming (ICALP), LNCS 2076, pages 64\u201378, 2001."},{"key":"37_CR16","unstructured":"I. Wegener and C. Witt. On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions. Journal of Discrete Algorithms, 2002. To appear."}],"container-title":["Lecture Notes in Computer Science","STACS 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36494-3_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T19:03:00Z","timestamp":1558983780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36494-3_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540006237","9783540364948"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-36494-3_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}