{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:25Z","timestamp":1759637725240,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642223709"},{"type":"electronic","value":"9783642223716"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22371-6_13","type":"book-chapter","created":{"date-parts":[[2011,7,4]],"date-time":"2011-07-04T09:03:50Z","timestamp":1309770230000},"page":"117-131","source":"Crossref","is-referenced-by-count":17,"title":["On the Analysis of the Immune-Inspired B-Cell Algorithm for the Vertex Cover Problem"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Jansen","sequence":"first","affiliation":[]},{"given":"Pietro S.","family":"Oliveto","sequence":"additional","affiliation":[]},{"given":"Christine","family":"Zarges","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/11536444_24","volume-title":"Artificial Immune Systems","author":"E. Clark","year":"2005","unstructured":"Clark, E., Hone, A., Timmis, J.: A markov chain model of the B-cell algorithm. In: Jacob, C., Pilat, M.L., Bentley, P.J., Timmis, J.I. (eds.) ICARIS 2005. LNCS, vol.\u00a03627, pp. 318\u2013330. Springer, Heidelberg (2005)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-540-30220-9_22","volume-title":"Artificial Immune Systems","author":"V. Cutello","year":"2004","unstructured":"Cutello, V., Nicosia, G., Pavone, M.: Exploring the capability of immune algorithms: A characterization of hypermutation operators. In: Nicosia, G., Cutello, V., Bentley, P.J., Timmis, J. (eds.) ICARIS 2004. LNCS, vol.\u00a03239, pp. 263\u2013276. Springer, Heidelberg (2004)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Dasgupta, D., Ni\u00f1o, L.F.: Immunological Computation: Theory and Applications. Auerbach (2008)","DOI":"10.1201\/9781420065466"},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/TEVC.2002.1011539","volume":"6","author":"L. Castro de","year":"2002","unstructured":"de Castro, L., Zuben, F.: Learning and optimization using the clonal selection principle. IEEE T. on Evol. Comp.\u00a06(3), 239\u2013251 (2002)","journal-title":"IEEE T. on Evol. Comp."},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I. Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating vertex cover. A. of Mathematics\u00a0162(1), 439\u2013485 (2005)","journal-title":"A. of Mathematics"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. In: Proc. of GECCO 2010, pp. 1449\u20131456 (2010)","DOI":"10.1145\/1830483.1830748"},{"issue":"51","key":"13_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S. Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science\u00a0276(51), 51\u201381 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"13_CR8","doi-asserted-by":"publisher","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 of Comp. Sys.\u00a039(4), 525\u2013544 (2006)","journal-title":"Theory of Comp. Sys."},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1162\/EVCO_a_00003","volume":"18","author":"T. Friedrich","year":"2010","unstructured":"Friedrich, T., Hebbinghaus, N., Neumann, F., He, J., Witt, C.: Approximating covering problems by randomized search heuristics using multi-objective models. Evol. Comp.\u00a018(4), 617\u2013633 (2010)","journal-title":"Evol. Comp."},{"issue":"6","key":"13_CR10","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.tcs.2010.09.027","volume":"412","author":"T. Jansen","year":"2011","unstructured":"Jansen, T., Zarges, C.: Analyzing different variants of immune inspired somatic contiguous hypermutations. Theoretical Computer Science\u00a0412(6), 517\u2013533 (2011)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1597036.1597045","volume":"5","author":"G. Karakostas","year":"2009","unstructured":"Karakostas, G.: A better approximation ratio for the vertex cover problem. ACM Trans. on Algorithms\u00a05(4), 41:1\u201341:8 (2009)","journal-title":"ACM Trans. on Algorithms"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-45105-6_26","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"J. Kelsey","year":"2003","unstructured":"Kelsey, J., Timmis, J.: Immune inspired somatic contiguous hypermutation for function optimisation. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol.\u00a02724, pp. 207\u2013218. Springer, Heidelberg (2003)"},{"key":"13_CR13","unstructured":"Oliveto, P.S.: A proof that crossover helps to optimise vertex cover problems. Technical report, University of Birmingham(2011), \n                    \n                      http:\/\/www.cs.bham.ac.uk\/~olivetps"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Oliveto, P.S., He, J., Yao, X.: Analysis of population-based evolutionary algorithms for the vertex cover problem. In: Proc. of CEC 2008 (WCCI 2008), pp. 1563\u20131570 (2008)","DOI":"10.1109\/CEC.2008.4631000"},{"issue":"5","key":"13_CR15","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TEVC.2009.2014362","volume":"13","author":"P.S. Oliveto","year":"2009","unstructured":"Oliveto, P.S., He, J., Yao, X.: Analysis of the (1+1)-EA for finding approximate solutions to vertex cover problems. IEEE T. Evol. Comp.\u00a013(5), 1006\u20131029 (2009)","journal-title":"IEEE T. Evol. Comp."},{"key":"13_CR16","volume-title":"Representations for Genetic and Evol. Algorithms","author":"F. Rothlauf","year":"2006","unstructured":"Rothlauf, F.: Representations for Genetic and Evol. Algorithms. Springer, Heidelberg (2006)"},{"key":"13_CR17","first-page":"35","volume-title":"Advances in Information Processing and Protection","author":"K. Trojanowski","year":"2008","unstructured":"Trojanowski, K., Wierzcho\u0144, S.: On some properties of the B-cell algorithm in non-stationary environments. In: Advances in Information Processing and Protection, pp. 35\u201344. Springer, Heidelberg (2008)"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-87700-4_12","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN X","author":"C. Zarges","year":"2008","unstructured":"Zarges, C.: Rigorous runtime analysis of inversely fitness proportional mutation rates. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol.\u00a05199, pp. 112\u2013122. Springer, Heidelberg (2008)"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Zarges, C.: On the utility of the population size for inversely fitness proportional mutation rates. In: Proc. of FOGA 2009, pp. 39\u201346 (2009)","DOI":"10.1145\/1527125.1527132"}],"container-title":["Lecture Notes in Computer Science","Artificial Immune Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22371-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T18:54:47Z","timestamp":1553885687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22371-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642223709","9783642223716"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22371-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}