{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T12:03:26Z","timestamp":1763726606859},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329364"},{"type":"electronic","value":"9783642329371"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32937-1_6","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T14:49:02Z","timestamp":1345906142000},"page":"52-61","source":"Crossref","is-referenced-by-count":20,"title":["A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling"],"prefix":"10.1007","author":[{"given":"Andrew M.","family":"Sutton","sequence":"first","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Auger, A., Doerr, B.: Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Publishing Company (2011)","DOI":"10.1142\/7438"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. In: Pelikan, M., Branke, J. (eds.) GECCO, pp. 1449\u20131456. ACM (2010)","DOI":"10.1145\/1830483.1830748"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to Nash equilibrium in load balancing. ACM Transactions on Algorithms\u00a03(3) (2007)","DOI":"10.1145\/1273340.1273348"},{"key":"6_CR5","unstructured":"Fernau, H.: Parameterized Algorithmics: A Graph Theoretic Approach. Habilitationsschrift (English), Universit\u00e4t T\u00fcbingen (2005)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Goldberg, P.W.: Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game. In: Chaudhuri, S., Kutten, S. (eds.) PODC, pp. 131\u2013140. ACM (2004)","DOI":"10.1145\/1011767.1011787"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Gunia, C.: On the analysis of the approximation capability of simple evolutionary algorithms for scheduling problems. In: Beyer, H.G., O\u2019Reilly, U.M. (eds.) GECCO, pp. 571\u2013578. ACM (2005)","DOI":"10.1145\/1068009.1068106"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-642-15844-5_21","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"S. Kratsch","year":"2010","unstructured":"Kratsch, S., Lehre, P.K., Neumann, F., Oliveto, P.S.: Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI, Part I. LNCS, vol.\u00a06238, pp. 204\u2013213. Springer, Heidelberg (2010)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Kratsch, S., Neumann, F.: Fixed-parameter evolutionary algorithms and the vertex cover problem. In: Rothlauf, F. (ed.) GECCO, pp. 293\u2013300. ACM (2009)","DOI":"10.1145\/1569901.1569943"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization \u2013 Algorithms and Their Computational Complexity. Springer (2010)","DOI":"10.1007\/978-3-642-16544-3"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Pinedo, M.: Scheduling: theory, algorithms, and systems. Springer (2012)","DOI":"10.1007\/978-1-4614-2361-4"},{"key":"6_CR12","unstructured":"Sutton, A.M., Day, J., Neumann, F.: A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT. In: GECCO. ACM (to appear, 2012)"},{"key":"6_CR13","unstructured":"Sutton, A.M., Neumann, F.: A parameterized runtime analysis of evolutionary algorithms for the Euclidean traveling salesperson problem. In: AAAI. AAAI Press (to appear, 2012)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-31856-9_4","volume-title":"STACS 2005","author":"C. Witt","year":"2005","unstructured":"Witt, C.: Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 44\u201356. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature - PPSN XII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32937-1_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:49:27Z","timestamp":1620114567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32937-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329364","9783642329371"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32937-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}