{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T11:38:32Z","timestamp":1772192312216,"version":"3.50.1"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502464"],"award-info":[{"award-number":["61502464"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61370156"],"award-info":[{"award-number":["61370156"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61806050"],"award-info":[{"award-number":["61806050"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61503074"],"award-info":[{"award-number":["61503074"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2895738","type":"journal-article","created":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T20:33:37Z","timestamp":1548966817000},"page":"17389-17402","source":"Crossref","is-referenced-by-count":9,"title":["An Improved Memetic Algorithm for the Partial Vertex Cover Problem"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9328-1328","authenticated-orcid":false,"given":"Yupeng","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changze","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiyuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingjie","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2599-7"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1166\/jctn.2016.4869"},{"key":"ref33","author":"moscato","year":"1999","journal-title":"Memetic Algorithms A Short Introduction"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9793-2"},{"key":"ref31","first-page":"13","article-title":"On partial vertex cover and budgeted maximum coverage problems in bipartite graphs","author":"caskurlu","year":"2014","journal-title":"Proc IFIP Conf Theoretical Computer Science"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9003-z"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.08.011"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.02.016"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2546340"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2674800"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.06.002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s12065-010-0035-y"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3907"},{"key":"ref13","first-page":"11","article-title":"Cliques, coloring, and satisfiability: Second DIMACS implementation challenge","volume":"26","author":"johnson","year":"1993","journal-title":"DIMACS Ser Discrete Math Theor Comput Sci"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.04.001"},{"key":"ref15","first-page":"805","article-title":"Two efficient local search algorithms for maximum weight clique problem","author":"wang","year":"2016","journal-title":"Proc AAAI"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2324-6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.06.026"},{"key":"ref18","first-page":"561","article-title":"Upper bounds for vertex cover further improved","author":"niedermeier","year":"1999","journal-title":"Proc Third Ann Symp Theoretical Aspects of Computer Science"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.08.052"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1150"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.06.019"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0053968"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.46.6.820"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2800-z"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45753-4_15"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(02)00256-8"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-23247-3","volume":"379","author":"neri","year":"2012","journal-title":"Handbook of Memetic Algorithms"},{"key":"ref7","article-title":"On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms","author":"moscato","year":"1989"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1984.16"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1145\/3009966","article-title":"A survey on crossover operators","volume":"49","author":"pavai","year":"2017","journal-title":"ACM Comput Surv (CSUR)"},{"key":"ref1","first-page":"642","article-title":"Algorithms for facility location problems with outliers","author":"charikar","year":"2001","journal-title":"Proc 12th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/196"},{"key":"ref22","first-page":"747","article-title":"Balance between complexity and quality: Local search for minimum vertex cover in massive graphs","author":"cai","year":"2015","journal-title":"Proc IJCAI"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1613\/jair.5443","article-title":"Finding a small vertex cover in massive sparse graphs: Construct, local search, and preprocess","volume":"59","author":"cai","year":"2017","journal-title":"J Artif Intell Res"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000039523.95673.33"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.05.023"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.04.002"},{"key":"ref25","first-page":"298","article-title":"Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem","author":"bshouty","year":"1998","journal-title":"Proc Third Ann Symp Theoretical Aspects of Computer Science"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08631135.pdf?arnumber=8631135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T06:47:11Z","timestamp":1643266031000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8631135\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2895738","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}