{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T14:59:57Z","timestamp":1764687597470,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1109\/iscas.2012.6272111","type":"proceedings-article","created":{"date-parts":[[2012,8,22]],"date-time":"2012-08-22T12:02:44Z","timestamp":1345636964000},"page":"632-635","source":"Crossref","is-referenced-by-count":11,"title":["Performance comparison of approximation algorithms for the minimum weight vertex cover problem"],"prefix":"10.1109","author":[{"given":"Satoshi","family":"Taoka","sequence":"first","affiliation":[]},{"given":"Toshimasa","family":"Watanabe","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04921-1"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/1597036.1597045"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1002\/pamm.200700981"},{"key":"11","first-page":"424","article-title":"A new algorithm for the maximum-weight clique problem","volume":"8","author":"ostergard","year":"2001","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.03.030"},{"journal-title":"A Simple Probabilistic Approximation Algorithm for Vertex Cover","year":"1985","author":"pitt","key":"3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(81)90020-1"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90007-8"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1137\/0211045"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/BF03167363"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/BF00290149"},{"key":"5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0304-0208(08)73101-3","article-title":"A local-ratio theorem for approximating the weighted vertex cover problem","author":"bar-yehuda","year":"1985","journal-title":"Analysis and Design of Algorithms for Combinatorial Problems"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580444"},{"journal-title":"Approximation Algorithms for NP-Hard Problems","year":"1997","author":"hochbaum","key":"9"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"8"}],"event":{"name":"2012 IEEE International Symposium on Circuits and Systems - ISCAS 2012","start":{"date-parts":[[2012,5,20]]},"location":"Seoul, Korea (South)","end":{"date-parts":[[2012,5,23]]}},"container-title":["2012 IEEE International Symposium on Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6257548\/6270389\/06272111.pdf?arnumber=6272111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T19:09:36Z","timestamp":1497985776000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6272111\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/iscas.2012.6272111","relation":{},"subject":[],"published":{"date-parts":[[2012,5]]}}}