{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T10:46:53Z","timestamp":1764240413993,"version":"3.37.3"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council [Discovery Grant and Discovery Accelerator Supplement]","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3051741","type":"journal-article","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T21:52:02Z","timestamp":1610661122000},"page":"31932-31945","source":"Crossref","is-referenced-by-count":10,"title":["A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5442-6723","authenticated-orcid":false,"given":"Yang","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9185-3233","authenticated-orcid":false,"given":"Zhipeng","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3859-9229","authenticated-orcid":false,"given":"Abraham P.","family":"Punnen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-015-9909-3"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2754919"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105000"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595906000905"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000039523.95673.33"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2005.12.016"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-33954-2_28"},{"key":"ref35","article-title":"An exact algorithm for minimum weight vertex cover problem in large graphs","author":"wang","year":"2019","journal-title":"arXiv 1903 05948"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-015-9937-z"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9_33"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.07.011"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23247-3_6"},{"key":"ref13","first-page":"126","article-title":"Adaptation in natural and artificial systems","volume":"6","author":"holland","year":"1975","journal-title":"Quart Rev Biol"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.05.023"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.850260"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19084-6_26"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2019.1621218"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.08.053"},{"key":"ref28","first-page":"31","article-title":"The network data repository with interactive graph analytics and visualization","author":"rossi","year":"2015","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/11821069_21"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5_10"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.02.013"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05094-1"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2004.08.004"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012262"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1.3.190"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096763"},{"key":"ref2","first-page":"130","article-title":"A meta-heuristic algorithm for vertex covering problem based on gravity","volume":"1","author":"balachandar","year":"2009","journal-title":"Int J Math Stat Sci"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2.1.4"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1201\/9780367802486"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.06.039"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-017-9354-9"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.ejor.2009.07.016","article-title":"A memetic algorithm for graph coloring","volume":"203","author":"l\u00fc","year":"2010","journal-title":"Eur J Oper Res"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580444"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48056-5_5"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2018.06.004"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00005-1"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09324812.pdf?arnumber=9324812","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:57:18Z","timestamp":1639771038000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9324812\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3051741","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}