{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:21Z","timestamp":1750220061249,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,9,23]],"date-time":"2022-09-23T00:00:00Z","timestamp":1663891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,9,23]]},"DOI":"10.1145\/3568199.3568212","type":"proceedings-article","created":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T12:14:02Z","timestamp":1678104842000},"page":"82-86","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Approximate Greedy Algorithm for Vertex Covering"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3211-1453","authenticated-orcid":false,"given":"Xiaojun","family":"Yang","sequence":"first","affiliation":[{"name":"Department of Information and Intelligent Engineering, Yunnan College of Business Management, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3291-4600","authenticated-orcid":false,"given":"Lin","family":"Guo","sequence":"additional","affiliation":[{"name":"Department of Computer and EEE, Oxbridge College, Kunming University of Science and Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4536-9867","authenticated-orcid":false,"given":"Lanxiang","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Information and Intelligent Engineering, Yunnan College of Business Management, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,3,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Compendium ofparameterizedproblems","author":"MarcoCesati","year":"2006","unstructured":"MarcoCesati . Compendium ofparameterizedproblems . 2006 . MarcoCesati. Compendium ofparameterizedproblems. 2006."},{"issue":"5","key":"e_1_3_2_1_2_1","first-page":"1082","volume":"36","author":"Yong","year":"2015","unstructured":"WANG Yong -fei, NING Ai -bing, CHEN Ji -zhen, HU Lin -lin, YANG Xiao -fang. Measure and Conquer Algorithm for Minimum Weighted Vertex Cover Problem . Journal of Chinese Computer Systems , 2015 , 36 ( 5 ): 1082 - 1084 . WANG Yong-fei, NING Ai-bing, CHEN Ji-zhen, HU Lin-lin, YANG Xiao-fang. Measure and Conquer Algorithm for Minimum Weighted Vertex Cover Problem. Journal of Chinese Computer Systems, 2015, 36 (5): 1082-1084.","journal-title":"Journal of Chinese Computer Systems"},{"key":"e_1_3_2_1_3_1","volume-title":"et a1. Apr\u2014obabilistic parame\u2014 tetized algorithm for ve-rtex cover in stickermod, parallel and distributed processing symposium. Proceedings 18th International","author":"Chen Zhi","year":"2004","unstructured":"Chen Zhi yun, Qu Huiqin , Lu Mingning , et a1. Apr\u2014obabilistic parame\u2014 tetized algorithm for ve-rtex cover in stickermod, parallel and distributed processing symposium. Proceedings 18th International New York : IEEE Xplore , 2004 : l859-1862. Chen Zhi yun, Qu Huiqin, Lu Mingning, et a1. Apr\u2014obabilistic parame\u2014 tetized algorithm for ve-rtex cover in stickermod, parallel and distributed processing symposium. Proceedings 18th International New York: IEEE Xplore, 2004: l859-1862."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.663765"},{"issue":"14","key":"e_1_3_2_1_5_1","first-page":"27","article-title":"Hybrid genetic algorithm for vertex cover problem","volume":"43","author":"Cheng ZHOU","year":"2007","unstructured":"WANG Cheng , ZHOU Yuren , TU Weiping . Hybrid genetic algorithm for vertex cover problem . Computer Engineering and Applications , 2007 , 43 ( 14 ): 27 - 29 . WANG Cheng, ZHOU Yuren, TU Weiping. Hybrid genetic algorithm for vertex cover problem . Computer Engineering and Applications, 2007, 43 (14): 27-29.","journal-title":"Computer Engineering and Applications"},{"volume-title":"Parameterized computation and complexity: a new approach dealing with NP-hardness Journal of Computer Science and Technology","year":"2005","key":"e_1_3_2_1_6_1","unstructured":"chen J. Parameterized computation and complexity: a new approach dealing with NP-hardness Journal of Computer Science and Technology , 2005 ; 20: l807. chen J. Parameterized computation and complexity: a new approach dealing with NP-hardness Journal of Computer Science and Technology, 2005; 20: l807."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.03.007"},{"key":"e_1_3_2_1_8_1","unstructured":"Saket Saurabh.Exact algorithms for optimization and parameterized versions of some graph theoretic problems[D].Homi Bhabha National Institute 2008.  Saket Saurabh.Exact algorithms for optimization and parameterized versions of some graph theoretic problems[D].Homi Bhabha National Institute 2008."},{"key":"e_1_3_2_1_9_1","volume-title":"Local search with noisy strategy for minimum vertex cover in massive graphs\u0f3bC\u0f3d\/ \/ Proc of Pacific Rim International Conference on Artificial Intelligence","author":"Ma Zongjie","year":"2016","unstructured":"Ma Zongjie , Fan Yi, Su Kaile , et al. Local search with noisy strategy for minimum vertex cover in massive graphs\u0f3bC\u0f3d\/ \/ Proc of Pacific Rim International Conference on Artificial Intelligence . Berlin : Springer , 2016 : 283-294. Ma Zongjie, Fan Yi, Su Kaile, et al. Local search with noisy strategy for minimum vertex cover in massive graphs\u0f3bC\u0f3d\/ \/ Proc of Pacific Rim International Conference on Artificial Intelligence. Berlin:Springer, 2016: 283-294."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2011.07.006"},{"volume-title":"3rd InternationalConference on \u0f32isk Analysis and Crisis Response","author":"Luan C J","key":"e_1_3_2_1_11_1","unstructured":"Luan C J , Wang H Z , Lin S S . A reduced algorithm for the Demp-ster-Shafer theory of evidence\u0f3bC\u0f3d\/ \/ Proc of the 3rd InternationalConference on \u0f32isk Analysis and Crisis Response , 2011: 306-310. Luan C J, Wang H Z, Lin S S. A reduced algorithm for the Demp-ster-Shafer theory of evidence\u0f3bC\u0f3d\/ \/ Proc of the 3rd InternationalConference on \u0f32isk Analysis and Crisis Response, 2011: 306-310."}],"event":{"name":"MLMI 2022: 2022 5th International Conference on Machine Learning and Machine Intelligence","acronym":"MLMI 2022","location":"Hangzhou China"},"container-title":["2022 5th International Conference on Machine Learning and Machine Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3568199.3568212","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3568199.3568212","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:43Z","timestamp":1750183723000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3568199.3568212"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,23]]},"references-count":11,"alternative-id":["10.1145\/3568199.3568212","10.1145\/3568199"],"URL":"https:\/\/doi.org\/10.1145\/3568199.3568212","relation":{},"subject":[],"published":{"date-parts":[[2022,9,23]]},"assertion":[{"value":"2023-03-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}