{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:52:13Z","timestamp":1760709133201,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1109\/icis.2016.7550782","type":"proceedings-article","created":{"date-parts":[[2016,8,25]],"date-time":"2016-08-25T20:57:40Z","timestamp":1472158660000},"page":"1-5","source":"Crossref","is-referenced-by-count":5,"title":["A fast heuristic for the minimum weight vertex cover problem"],"prefix":"10.1109","author":[{"given":"Satoshi","family":"Shimizu","sequence":"first","affiliation":[]},{"given":"Kazuaki","family":"Yamaguchi","sequence":"additional","affiliation":[]},{"given":"Toshiki","family":"Saitoh","sequence":"additional","affiliation":[]},{"given":"Sumio","family":"Masuda","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","article-title":"A simple probabilistic approximation algorithm for vertex cover","author":"pitt","year":"1985","journal-title":"Yale tech report"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(81)90020-1"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E96.A.1331"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-0208(08)73101-3"},{"key":"ref11","first-page":"84","article-title":"Optimal table method for finding the maximum weight clique","author":"shimizu","year":"2013","journal-title":"Proceedings of the 13th International Conference on Applied Computer Science(ACS' 13)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580444"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"3520","DOI":"10.1016\/j.cor.2005.03.030","article-title":"Experimental analysis of approximation algorithms for the vertex cover and set covering problems","volume":"33","author":"fernando","year":"2006","journal-title":"Computers & Operations Research"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2006.03.014"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90007-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1671970.1865971"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","article-title":"A review on algorithms for maximum clique problems","volume":"242","author":"qinghua wu","year":"2015","journal-title":"European Journal of Operational Research"}],"event":{"name":"2016 IEEE\/ACIS 15th International Conference on Computer and Information Science (ICIS)","start":{"date-parts":[[2016,6,26]]},"location":"Okayama, Japan","end":{"date-parts":[[2016,6,29]]}},"container-title":["2016 IEEE\/ACIS 15th International Conference on Computer and Information Science (ICIS)"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/iel7\/7537873\/7550716\/07550782.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7537873\/7550716\/07550782.pdf?arnumber=7550782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T21:23:58Z","timestamp":1498339438000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7550782\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/icis.2016.7550782","relation":{},"subject":[],"published":{"date-parts":[[2016,6]]}}}