{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T15:56:03Z","timestamp":1765554963920,"version":"3.37.3"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,2,15]],"date-time":"2021-02-15T00:00:00Z","timestamp":1613347200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,15]],"date-time":"2021-02-15T00:00:00Z","timestamp":1613347200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s00453-021-00809-8","type":"journal-article","created":{"date-parts":[[2021,2,18]],"date-time":"2021-02-18T19:14:26Z","timestamp":1613675666000},"page":"1138-1163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1295-6715","authenticated-orcid":false,"given":"Andrew M.","family":"Sutton","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,15]]},"reference":[{"issue":"4\/5","key":"809_CR1","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/BF01940879","volume":"16","author":"H Alt","year":"1996","unstructured":"Alt, H., Guibas, L.J., Mehlhorn, K., Karp, R.M., Wigderson, A.: A method for obtaining randomized algorithms with small tail probabilities. Algorithmica 16(4\/5), 543\u2013547 (1996). https:\/\/doi.org\/10.1007\/BF01940879","journal-title":"Algorithmica"},{"key":"809_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach, 1st edn. Cambridge University Press, New York, NY (2009)","edition":"1"},{"key":"809_CR3","series-title":"Advances in Intelligent and Soft Computing","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-642-14883-5_70","volume-title":"Distributed Computing and Artificial Intelligence","author":"F Bahredar","year":"2010","unstructured":"Bahredar, F., Erfani, H., Javadi, H.H.S., Masaeli, N.: A meta heuristic solution for closest string problem using ant colony system. In: de Leon, A.P., de Carvalho, F., Rodr\u00edguez-Gonz\u00e1lez, S., De Paz Santana, J.F., Rodr\u00edguez, J.M.C. (eds.) Distributed Computing and Artificial Intelligence. Advances in intelligent and soft computing, vol. 79, pp. 549\u2013557. Springer, Berlin (2010). https:\/\/doi.org\/10.1007\/978-3-642-14883-5_70"},{"key":"809_CR4","doi-asserted-by":"publisher","unstructured":"Chimani, M., Woste, M., B\u00f6cker, S.: A closer look at the closest string and closest substring problem. In: Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 13\u201324. Society for Industrial and Applied Mathematics (2011). https:\/\/doi.org\/10.1137\/1.9781611972917.2","DOI":"10.1137\/1.9781611972917.2"},{"issue":"1","key":"809_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1162\/EVCO_a_00147","volume":"24","author":"D Corus","year":"2016","unstructured":"Corus, D., Lehre, P.K., Neumann, F., Pourhassan, M.: A parameterised complexity analysis of bi-level optimisation with evolutionary algorithms. Evolut. Comput. 24(1), 183\u2013203 (2016). https:\/\/doi.org\/10.1162\/EVCO_a_00147","journal-title":"Evolut. Comput."},{"issue":"5","key":"809_CR6","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1109\/TEVC.2017.2745715","volume":"22","author":"D Corus","year":"2018","unstructured":"Corus, D., Oliveto, P.S.: Standard steady state genetic algorithms can hillclimb faster than mutation-only evolutionary algorithms. IEEE Trans. Evolut. Comput. 22(5), 720\u2013732 (2018). https:\/\/doi.org\/10.1109\/TEVC.2017.2745715","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"809_CR7","doi-asserted-by":"publisher","first-page":"3676","DOI":"10.1007\/s00453-020-00743-1","volume":"82","author":"D Corus","year":"2020","unstructured":"Corus, D., Oliveto, P.S.: On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms. Algorithmica 82, 3676\u20133706 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00743-1","journal-title":"Algorithmica"},{"key":"809_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"809_CR9","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1109\/TEVC.2017.2724201","volume":"22","author":"DC Dang","year":"2018","unstructured":"Dang, D.C., Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Lehre, P.K., Oliveto, P.S., Sudholt, D., Sutton, A.M.: Escaping local optima using crossover with emergent diversity. IEEE Trans. Evolut. Comput. 22, 484\u2013497 (2018). https:\/\/doi.org\/10.1109\/TEVC.2017.2724201","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"809_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.eswa.2019.06.063","volume":"137","author":"A Deniz","year":"2019","unstructured":"Deniz, A., Kiziloz, H.E.: On initial population generation in feature subset selection. Expert Syst. Appl. 137, 11\u201321 (2019). https:\/\/doi.org\/10.1016\/j.eswa.2019.06.063","journal-title":"Expert Syst. Appl."},{"key":"809_CR11","doi-asserted-by":"publisher","unstructured":"Dinu, L.P., Ionescu, R.: A genetic approximation of closest string via rank distance. In: Proceedings of the Thirteenth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 207\u2013214. IEEE (2011). https:\/\/doi.org\/10.1109\/SYNASC.2011.31","DOI":"10.1109\/SYNASC.2011.31"},{"issue":"6","key":"809_CR12","doi-asserted-by":"publisher","first-page":"e37576","DOI":"10.1371\/journal.pone.0037576","volume":"7","author":"LP Dinu","year":"2012","unstructured":"Dinu, L.P., Ionescu, R.: An efficient rank based approach for closest string and closest substring. PLoS ONE 7(6), e37576 (2012). https:\/\/doi.org\/10.1371\/journal.pone.0037576","journal-title":"PLoS ONE"},{"key":"809_CR13","first-page":"1","volume-title":"Theory of Randomized Search Heuristics","author":"B Doerr","year":"2011","unstructured":"Doerr, B.: Analyzing randomized search heuristics: tools from probability theory. In: Auger, A., Doerr, B. (eds.) Theory of Randomized Search Heuristics, pp. 1\u201320. World Scientific Publishing Company, Singapore (2011)"},{"key":"809_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2014.11.028","volume":"567","author":"B Doerr","year":"2015","unstructured":"Doerr, B., Doerr, C., Ebel, F.: From black-box complexity to designing new genetic algorithms. Theor. Comput. Sci. 567, 87\u2013104 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2014.11.028","journal-title":"Theor. Comput. Sci."},{"key":"809_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2010.10.035","volume":"425","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Happ, E., Klein, C.: Crossover can provably be useful in evolutionary computation. Theor. Comput. Sci. 425, 17\u201333 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2010.10.035","journal-title":"Theor. Comput. Sci."},{"key":"809_CR16","doi-asserted-by":"publisher","unstructured":"Doerr, B., Johannsen, D., K\u00f6tzing, T., Lehre, P.K., Wagner, M., Winzen, C.: Faster black-box algorithms through higher arity operators. In: Proceedings of the Eleventh Workshop on Foundations of Genetic Algorithms (FOGA), pp. 163\u2013172. Association for Computing Machinery (2011). https:\/\/doi.org\/10.1145\/1967654.1967669","DOI":"10.1145\/1967654.1967669"},{"key":"809_CR17","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2012.10.059","volume":"471","author":"B Doerr","year":"2013","unstructured":"Doerr, B., Johannsen, D., K\u00f6tzing, T., Neumann, F., Theile, M.: More effective crossover operators for the all-pairs shortest path problem. Theor. Comput. Sci. 471, 12\u201326 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2012.10.059","journal-title":"Theor. Comput. Sci."},{"key":"809_CR18","doi-asserted-by":"publisher","unstructured":"Doerr, B., Theile, M.: Improved analysis methods for crossover-based algorithms. In: Proceedings of the Eleventh Annual Conference on Genetic and Evolutionary Computation (GECCO), pp. 247\u2013254. Association for Computing Machinery (2009). https:\/\/doi.org\/10.1145\/1569901.1569937","DOI":"10.1145\/1569901.1569937"},{"key":"809_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R G Downey","year":"1999","unstructured":"Downey, R. G., Fellows, M. R.: Parameterized Complexity. Springer, Berlin (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0515-9"},{"key":"809_CR20","unstructured":"Evans, P.A., Smith, A.D., Wareham: The parameterized complexity of p-Center approximate substring problems problems. Tech. Rep. TR01-149, Faculty of Computer Science, University of New Brunswick (2001)"},{"key":"809_CR21","doi-asserted-by":"publisher","unstructured":"Faro, S., Pappalardo, E.: Ant-CSP: An ant colony optimization algorithm for the closest string problem. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorn\u00fd, J., Rumpe, B. (eds.) Proceedings of the Thirty-Sixth Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Lecture Notes in Computer Science, vol. 5901, pp. 370\u2013381. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-11266-9_31","DOI":"10.1007\/978-3-642-11266-9_31"},{"key":"809_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"issue":"2","key":"809_CR23","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02679443","volume":"30","author":"M Frances","year":"1997","unstructured":"Frances, M., Litman, A.: On covering problems of codes. Theory Comput. Syst. 30(2), 113\u2013119 (1997). https:\/\/doi.org\/10.1007\/BF02679443","journal-title":"Theory Comput. Syst."},{"key":"809_CR24","doi-asserted-by":"publisher","unstructured":"Friedrich, T., K\u00f6tzing, T., Sutton, A.M.: On the robustness of evolving populations. In: Handl, J., Hart, E., Lewis, P.R., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ochoa, G., Paechter, B. (eds.) Proceedings of the Fourteenth International Conference on Parallel Problem Solving from Nature (PPSN XIV), Lecture Notes in Computer Science, vol. 9921, pp. 771\u2013781. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_72","DOI":"10.1007\/978-3-319-45823-6_72"},{"issue":"1","key":"809_CR25","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00453-003-1028-3","volume":"37","author":"J Gramm","year":"2003","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for closest string and related problems. Algorithmica 37(1), 25\u201342 (2003). https:\/\/doi.org\/10.1007\/s00453-003-1028-3","journal-title":"Algorithmica"},{"issue":"6","key":"809_CR26","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.2307\/j.ctt7t6pw","volume":"6","author":"A Hedayat","year":"1972","unstructured":"Hedayat, A., Wallis, W.D.: Hadamard matrices and their applications. Ann. Stat. 6(6), 1184\u20131238 (1972). https:\/\/doi.org\/10.2307\/j.ctt7t6pw","journal-title":"Ann. Stat."},{"key":"809_CR27","doi-asserted-by":"publisher","unstructured":"Hill, R.R.: A Monte-Carlo study of genetic algorithm initial population generation methods. In: Farrington, P.A., Nembhard, H.B., Sturrock, D.T., Evans, G.W. (eds.) Proceedings of the Thirty-First Conference on Winter Simulation: Simulation\u2014A Bridge to the Future (WSC 1999), pp. 543\u2013547. WSC (1999). https:\/\/doi.org\/10.1109\/WSC.1999.823131","DOI":"10.1109\/WSC.1999.823131"},{"key":"809_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2010","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2010). https:\/\/doi.org\/10.1017\/CBO9780511807077"},{"issue":"1","key":"809_CR29","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1186\/1471-2105-12-106","volume":"12","author":"F Hufsky","year":"2011","unstructured":"Hufsky, F., Kuchenbecker, L., Jahn, K., Stoye, J., B\u00f6cker, S.: Swiftly computing center strings. BMC Bioinf. 12(1), 106 (2011). https:\/\/doi.org\/10.1186\/1471-2105-12-106","journal-title":"BMC Bioinf."},{"issue":"1","key":"809_CR30","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00453-002-0940-2","volume":"34","author":"T Jansen","year":"2002","unstructured":"Jansen, T., Wegener, I.: On the analysis of evolutionary algorithms: a proof that crossover really can help. Algorithmica 34(1), 47\u201366 (2002). https:\/\/doi.org\/10.1007\/s00453-002-0940-2","journal-title":"Algorithmica"},{"key":"809_CR31","doi-asserted-by":"publisher","unstructured":"Julstrom, B.A.: Seeding the population: improved performance in a genetic algorithm for the rectilinear steiner problem. In: Berghel, H., Hlengl, T., Urban, J.E. (eds.) Proceedings of the 1994 ACM Symposium on Applied Computing (SAC\u201994), pp. 222\u2013226. Association for Computing Machinery (1994). https:\/\/doi.org\/10.1145\/326619.326728","DOI":"10.1145\/326619.326728"},{"issue":"3","key":"809_CR32","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/s00453-015-0048-0","volume":"75","author":"T K\u00f6tzing","year":"2016","unstructured":"K\u00f6tzing, T.: Concentration of first hitting times under additive drift. Algorithmica 75(3), 490\u2013506 (2016). https:\/\/doi.org\/10.1007\/s00453-015-0048-0","journal-title":"Algorithmica"},{"key":"809_CR33","doi-asserted-by":"publisher","unstructured":"K\u00f6tzing, T., Sudholt, D., Theile, M.: How crossover helps in pseudo-Boolean optimization. In: Proceedings of the Annual Genetic and Evolutionary Computation Conference (GECCO), pp. 989\u2013996. Association for Computing Machinery (2011). https:\/\/doi.org\/10.1145\/2001576.2001711","DOI":"10.1145\/2001576.2001711"},{"key":"809_CR34","doi-asserted-by":"publisher","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.,\u00a0Cotta, C.,\u00a0Kolodziej, J.,\u00a0Rudolph, G.\u00a0(eds.) Proceedings of the Eleventh International Conference on Parallel Problem Solving from Nature (PPSN XI), Lecture Notes in Computer Science, vol. 6238, pp. 204\u2013213. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_21","DOI":"10.1007\/978-3-642-15844-5_21"},{"issue":"4","key":"809_CR35","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1007\/s00453-012-9660-4","volume":"65","author":"S Kratsch","year":"2013","unstructured":"Kratsch, S., Neumann, F.: Fixed-parameter evolutionary algorithms and the vertex cover problem. Algorithmica 65(4), 754\u2013771 (2013). https:\/\/doi.org\/10.1007\/s00453-012-9660-4","journal-title":"Algorithmica"},{"key":"809_CR36","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2019.11.036","volume":"816","author":"T K\u00f6tzing","year":"2020","unstructured":"K\u00f6tzing, T., Lagodzinski, J.G., Lengler, J., Melnichenko, A.: Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming. Theor. Comput. Sci. 816, 96\u2013113 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.11.036","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"809_CR37","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/s0890-5401(03)00057-9","volume":"185","author":"JK Lanct\u00f4t","year":"2003","unstructured":"Lanct\u00f4t, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Inf. Comput. 185(1), 41\u201355 (2003). https:\/\/doi.org\/10.1016\/s0890-5401(03)00057-9","journal-title":"Inf. Comput."},{"issue":"9","key":"809_CR38","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1007\/s00500-010-0610-2","volume":"15","author":"PK Lehre","year":"2011","unstructured":"Lehre, P.K., Yao, X.: Crossover can be constructive when computing unique input-output sequences. Soft Comput. 15(9), 1675\u20131687 (2011). https:\/\/doi.org\/10.1007\/s00500-010-0610-2","journal-title":"Soft Comput."},{"key":"809_CR39","doi-asserted-by":"publisher","unstructured":"Lengler, J., Meier, J.: Large population sizes and crossover help in dynamic environments. In: B\u00e4ck, T.,\u00a0Preuss, M.,\u00a0Deutz, A.,\u00a0Wang, H.,\u00a0Doerr, C.,\u00a0Emmerich, M.,\u00a0Trautmann, H.\u00a0(eds.) Proceedings of the Sixteenth International Conference on Parallel Problem Solving from Nature (PPSN XVI), Lecture Notes in Computer Science, vol. 12269, pp. 610\u2013622. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-58112-1_42","DOI":"10.1007\/978-3-030-58112-1_42"},{"key":"809_CR40","doi-asserted-by":"publisher","unstructured":"Liu, X., He, H., S\u00fdkora, O.: Parallel genetic algorithm and parallel simulated annealing algorithm for the closest string problem. In: Li, X., Wang, S., Dong, Z.Y. (eds.) Advanced Data Mining and Applications, Lecture Notes in Computer Science, vol. 3584, pp. 591\u2013597. Springer (2005). https:\/\/doi.org\/10.1007\/11527503_70","DOI":"10.1007\/11527503_70"},{"issue":"4","key":"809_CR41","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. Inf. Process. Lett. 47(4), 173\u2013180 (1993). https:\/\/doi.org\/10.1016\/0020-0190(93)90029-9","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"809_CR42","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1137\/080739069","volume":"39","author":"B Ma","year":"2009","unstructured":"Ma, B., Sun, X.: More efficient algorithms for closest string and substring problems. SIAM J. Comput. 39(4), 1432\u20131443 (2009). https:\/\/doi.org\/10.1137\/080739069","journal-title":"SIAM J. Comput."},{"key":"809_CR43","doi-asserted-by":"publisher","unstructured":"Mauch, H., Melzer, M.J., Hu, J.S.: Genetic algorithm approach for the closest string problem. In: Proceedings of the IEEE Bioinformatics Conference, pp. 560\u2013561. IEEE (2003). https:\/\/doi.org\/10.1109\/CSB.2003.1227407","DOI":"10.1109\/CSB.2003.1227407"},{"key":"809_CR44","doi-asserted-by":"publisher","unstructured":"Sch\u00f6ning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: Proceedings of the Fortieth Annual Symposium on Foundations of Computer Science (FOCS), pp. 410\u2013414. IEEE (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814612","DOI":"10.1109\/SFFCS.1999.814612"},{"key":"809_CR45","doi-asserted-by":"publisher","unstructured":"Sudholt, D.: Crossover is provably essential for the Ising model on trees. In: Proceedings of the Seventh Annual Genetic and Evolutionary Computation Conference (GECCO), pp. 1161\u20131167. Association for Computing Machinery (2005). https:\/\/doi.org\/10.1145\/1068009.1068202","DOI":"10.1145\/1068009.1068202"},{"key":"809_CR46","doi-asserted-by":"publisher","unstructured":"Sudholt, D.: Crossover speeds up building-block assembly. In: Proceedings of the Fourteenth Annual Conference on Genetic and Evolutionary Computation (GECCO), pp. 689\u2013702. Association for Computing Machinery (2012). https:\/\/doi.org\/10.1145\/2330163.2330260","DOI":"10.1145\/2330163.2330260"},{"key":"809_CR47","doi-asserted-by":"publisher","unstructured":"Sutton, A.M.: Crossover can simulate bounded tree search on a fixed-parameter tractable optimization problem. In: Proceedings of the Annual Genetic and Evolutionary Computation Conference (GECCO), pp. 1531\u20131538. Association for Computing Machinery (2018). https:\/\/doi.org\/10.1145\/3205455.3205598","DOI":"10.1145\/3205455.3205598"},{"key":"809_CR48","doi-asserted-by":"publisher","unstructured":"Sutton, A.M., Neumann, F.: A parameterized runtime analysis of simple evolutionary algorithms for makespan scheduling. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) Proceedings of the Twelfth International Conference on Parallel Problem Solving from Nature (PPSN XII), Lecture Notes in Computer Science, vol. 7491, pp. 52\u201361. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-32937-1_6","DOI":"10.1007\/978-3-642-32937-1_6"},{"issue":"4","key":"809_CR49","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1162\/EVCO_a_00119","volume":"22","author":"AM Sutton","year":"2014","unstructured":"Sutton, A.M., Neumann, F., Nallaperuma, S.: Parameterized runtime analyses of evolutionary algorithms for the planar Euclidean traveling salesperson problem. Evolut. Comput. 22(4), 595\u2013628 (2014). https:\/\/doi.org\/10.1162\/EVCO_a_00119","journal-title":"Evolut. Comput."},{"key":"809_CR50","doi-asserted-by":"publisher","unstructured":"Wang, L., Zhu, B.: Efficient Algorithms for the Closest String and Distinguishing String Selection Problems. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) Frontiers in Algorithmics, Lecture Notes in Computer Science, vol. 5598, pp. 261\u2013270. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-02270-8_27","DOI":"10.1007\/978-3-642-02270-8_27"},{"key":"809_CR51","doi-asserted-by":"publisher","unstructured":"Yang, C., Nygard, K.E.: The effects of initial population in genetic search for time constrained traveling salesman problems. In: Kwasny, S.C., Buck, J.F. (eds.) Proceedings of the Twenty-First ACM Computer Science Conference (CSC), pp. 378\u2013383. Association for Computing Machinery (1993). https:\/\/doi.org\/10.1145\/170791.170875","DOI":"10.1145\/170791.170875"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00809-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-021-00809-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00809-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,21]],"date-time":"2021-03-21T07:03:51Z","timestamp":1616310231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-021-00809-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,15]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["809"],"URL":"https:\/\/doi.org\/10.1007\/s00453-021-00809-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2021,2,15]]},"assertion":[{"value":"15 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}