{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:04:06Z","timestamp":1743069846363,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319221793"},{"type":"electronic","value":"9783319221809"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22180-9_18","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T13:07:32Z","timestamp":1439212052000},"page":"177-188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Targeting the Minimum Vertex Set Problem with an Enhanced Genetic Algorithm Improved with Local Search Strategies"],"prefix":"10.1007","author":[{"given":"Vincenzo","family":"Cutello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Pappalardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1613\/jair.638","volume":"12","author":"A Becker","year":"2000","unstructured":"Becker, A., Bar-Yehuda, R.: Randomized algorithms for the loop cutset problem. J. Artif. Intell. Res. 12, 219\u2013234 (2000)","journal-title":"J. Artif. Intell. Res."},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0004-3702(95)00004-6","volume":"83","author":"A Becker","year":"1996","unstructured":"Becker, A., Geiger, D.: Optimization of pearl\u2019s method of conditioning and greedy like approximation algorithms for the vertex feedback set problem. Artif. Intell. 83, 167\u2013188 (1996)","journal-title":"Artif. Intell."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-22300-6_11","volume":"6844","author":"P Bonsma","year":"2011","unstructured":"Bonsma, P., Lokshtanov, D.: Feedback vertex set in mixed graphs. Lect. Notes Comput. Sci. 6844, 122\u2013133 (2011)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"6","key":"18_CR4","doi-asserted-by":"publisher","first-page":"1993","DOI":"10.1137\/S0097539798338163","volume":"30","author":"MC Cai","year":"2001","unstructured":"Cai, M.C., Deng, X., Zang, W.: An approximation algorithm for feedback vertex sets in tournaments. SIAM J. Comput. 30(6), 1993\u20132007 (2001)","journal-title":"SIAM J. Comput."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/PL00009191","volume":"20","author":"G Even","year":"1998","unstructured":"Even, G., Naor, S., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20, 151\u2013174 (1998)","journal-title":"Algorithmica"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Global Opt. 6, 109\u2013133 (1995)","journal-title":"J. Global Opt."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-1-4757-3023-4_4","volume-title":"Handbook of Combinatorial Optimization, Supplement","author":"P Festa","year":"1999","unstructured":"Festa, P., Pardalos, P.M., Resende, M.G.C.: Feedback set problems. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, Supplement, vol. A, pp. 209\u2013259. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"18_CR8","volume-title":"Computers and Intractability - A guide to the theory of NP-completeness","author":"MR 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, San Francisco (1979)"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Goldberg, D.E.: A comparative analysis of selection schemes used in genetic algorithms. Morgan Kaufmann Publishers, gregory rawlins (edn) (1991)","DOI":"10.1016\/B978-0-08-050684-5.50008-2"},{"key":"18_CR10","first-page":"94","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"DS Hockbaum","year":"1997","unstructured":"Hockbaum, D.S.: Approximating covering and packing problems: set cover, vertex cover, indipendent set, and related problems. In: Hockbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 94\u2013143. PWS Publishing Company, Boston (1997)"},{"key":"18_CR11","unstructured":"Kann, V.: On the Approximability of NP-complete Optimization Problems. Ph.D. thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm (1992)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1137\/S0097539795286612","volume":"28","author":"S Khanna","year":"1999","unstructured":"Khanna, S., Motwani, R., Sudan, M., Vazirani, U.: On syntactic versus computational views of approximability. SIAM J. Comp. 28, 164\u2013191 (1999)","journal-title":"SIAM J. Comp."},{"key":"18_CR14","unstructured":"Lin, H.M., Jou, J.Y.: Computing minimum feedback vertex sets by contraction operations and its applications on cad. In: International Conference on Computer Design, (ICCD 1999). pp. 364\u2013369 (10\u201313 October 1999)"},{"issue":"3","key":"18_CR15","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1109\/43.833199","volume":"19","author":"HM Lin","year":"2000","unstructured":"Lin, H.M., Jou, J.Y.: On computing the minimum feedback vertex set of a directed graph by contraction operations. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(3), 295\u2013307 (2000)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. System Sci 43, 425\u2013440 (1991)","journal-title":"J. Comput. System Sci"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/11539902_19","volume-title":"Advances in Natural Computation","author":"F Pappalardo","year":"2005","unstructured":"Pappalardo, F.: Using Viruses to Improve GAs. In: Wang, L., Chen, K., S. Ong, Y. (eds.) ICNC 2005. LNCS, vol. 3612, pp. 161\u2013170. Springer, Heidelberg (2005)"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1023\/A:1009736921890","volume":"2","author":"PM Pardalos","year":"1999","unstructured":"Pardalos, P.M., Qian, T., Resende, M.G.C.: A greedy randomized adaptive search procedure for feedback vertex set. J. Comb. Opt. 2, 399\u2013412 (1999)","journal-title":"J. Comb. Opt."},{"issue":"1","key":"18_CR19","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1101\/gr.1536204","volume":"14","author":"M Pop","year":"2004","unstructured":"Pop, M., Kosack, D., Salzberg, S.: Hierarchical scaffolding with bambus. Genome Res. 14(1), 149\u2013159 (2004)","journal-title":"Genome Res."},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01200760","volume":"15","author":"P Seymour","year":"1995","unstructured":"Seymour, P.: Packing directed circuits fractionally. Combinatorica 15, 281\u2013288 (1995)","journal-title":"Combinatorica"},{"key":"18_CR21","first-page":"645","volume":"8","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: A linear time algorithm for finding cutsets in reduced graphs. J. Comput. 8, 645\u2013655 (1979)","journal-title":"J. Com- put."},{"issue":"1","key":"18_CR22","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1093\/bioinformatics\/btr620","volume":"28","author":"N Soranzo","year":"2012","unstructured":"Soranzo, N., Ramezani, F., Iacono, G., Altafini, C.: Decompositions of large-scale biological systems based on dynamical properties. Bioinform. 28(1), 76\u201383 (2012)","journal-title":"Bioinform."},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/3-540-52292-1_16","volume-title":"Graph-Theoretic Con- cepts in Computer Science","author":"E Speckenmeyer","year":"1989","unstructured":"Speckenmeyer, E.: On feedback problems in digraphs. Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science, vol. 411, pp. 218\u2013231. Springer-Verlag, Berlin (1989)"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Taoka, S., Watanabe, T.: Performance comparison of approximation algorithms for the minimum weight vertex cover problem. In: SCAS 2012 - 2012 IEEE International Symposium on Circuits and Systems, vol. 6272111, pp. 632\u2013635 (2012)","DOI":"10.1109\/ISCAS.2012.6272111"},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1145\/3149.3159","volume":"32","author":"C Wang","year":"1985","unstructured":"Wang, C., Lloyd, E., Soffa, M.: Feedbackvertexsetsandcyclicallyreduciblegraphs. J. ACM 32, 296\u2013313 (1985)","journal-title":"J. ACM"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node and edge-delition np-complete problems. In: Proceedings of the 10-th Annual ACM Symposium on Theory of Computing. pp. 253\u2013264 (1978)","DOI":"10.1145\/800133.804355"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Methodologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22180-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T18:37:40Z","timestamp":1674239860000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22180-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319221793","9783319221809"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22180-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}