{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:13:06Z","timestamp":1725559986731},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283201"},{"type":"electronic","value":"9783540318637"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11539902_19","type":"book-chapter","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T21:50:31Z","timestamp":1279662631000},"page":"161-170","source":"Crossref","is-referenced-by-count":1,"title":["Using Viruses to Improve GAs"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Pappalardo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"B\u00e4ck, T., Eiben, A., Vink, M.: A superior evolutionary algorithm for 3-SAT. In: Proceedings of the 7th Annual Conference on Evolutionary Programming, pp. 125\u2013136 (1998)","DOI":"10.1007\/BFb0040766"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Goldwasser, S., Lund, G., Russel, A.: Efficient probabilistically checkable proofs and applications to approximations. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 294\u2013304 (1993)","DOI":"10.1145\/167088.167174"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Cutello, V., Mastriani, E., Pappalardo, F.: An evolutionary algorithm for the T-constrained variation of the Minimum Hitting Set Problem. In: Proceedings of 2002 IEEE Congress on Evolutionary Computation (CEC 2002), vol.\u00a01, pp. 366\u2013371 (2002)","DOI":"10.1109\/CEC.2002.1006262"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of logn for approximating set cover. Journal of ACM\u00a045, 634\u2013652 (1998)","journal-title":"Journal of ACM"},{"issue":"4","key":"19_CR5","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P. Galinier","year":"1999","unstructured":"Galinier, P.: Hybrid Evolutionary Algorithms for Graph Coloring. Journal of Combinatorial Optimization\u00a03(4), 379\u2013397 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"key":"19_CR6","volume-title":"Computers and Intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, New York (1979)"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"1","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. System Sci.\u00a01, 256\u2013278 (1974)","journal-title":"J. Comput. System Sci."},{"key":"19_CR8","unstructured":"Khuri, S., B\u00e4ck, T.: An Evolutionary Heuristic for the Minimum Vertex Cover Problem. In: Proc. of the KI 1994 Workshop (1994)"},{"key":"19_CR9","unstructured":"Laguna, M., Moscato, P.: On Genetic Crossover Operators for Relative Order Preservation. In: Diaz, B.A. (ed.) C3P Report 778, Algoritmos Geneticos, ch. 3. Optimizacion Heuristica y Redes Neuronales, Paraninfo, Madrid, Espanya (1996)"},{"key":"19_CR10","unstructured":"Manner, R., Manderick, B.: Genetic Operators, the Fitness Landscape and the Traveling Salesman Problem. In: Parallel Problem Solving from Nature-PPSN 2, pp. 219\u2013228 (1992)"},{"key":"19_CR11","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison Wesley, Reading (1994)"},{"key":"19_CR12","first-page":"407","volume-title":"Combinatorial Optimization","author":"C.H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization, pp. 407\u2013408. Prentice-Hall, Englewood Cliffs (1982)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP. In: Proceedings of the 29th Ann. ACM Symp. on Theory of Computation, pp. 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Slavik, P.: A tight analysis of the greedy algorithm for set cover. In: Proceedings of 28th ACM Symposium on Theory of Comp., pp. 435\u2013439 (1996)","DOI":"10.1145\/237814.237991"}],"container-title":["Lecture Notes in Computer Science","Advances in Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539902_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:17:30Z","timestamp":1605644250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539902_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283201","9783540318637"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11539902_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}