{"id":"https://openalex.org/W4323344612","doi":"https://doi.org/10.1145/3568199.3568212","title":"An Improved Approximate Greedy Algorithm for Vertex Covering","display_name":"An Improved Approximate Greedy Algorithm for Vertex Covering","publication_year":2022,"publication_date":"2022-09-23","ids":{"openalex":"https://openalex.org/W4323344612","doi":"https://doi.org/10.1145/3568199.3568212"},"language":"en","primary_location":{"id":"doi:10.1145/3568199.3568212","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1145/3568199.3568212","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 5th International Conference on Machine Learning and Machine Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039955102","display_name":"Xiaojun Yang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiaojun Yang","raw_affiliation_strings":["Department of Information and Intelligent Engineering, Yunnan College of Business Management, China"],"raw_orcid":"https://orcid.org/0000-0003-3211-1453","affiliations":[{"raw_affiliation_string":"Department of Information and Intelligent Engineering, Yunnan College of Business Management, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"Lin Guo","orcid":"https://orcid.org/0000-0003-3291-4600"},"institutions":[{"id":"https://openalex.org/I10660446","display_name":"Kunming University of Science and Technology","ror":"https://ror.org/00xyeez13","country_code":"CN","type":"education","lineage":["https://openalex.org/I10660446"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lin Guo","raw_affiliation_strings":["Department of Computer and EEE, Oxbridge College, Kunming University of Science and Technology, China"],"raw_orcid":"https://orcid.org/0000-0003-3291-4600","affiliations":[{"raw_affiliation_string":"Department of Computer and EEE, Oxbridge College, Kunming University of Science and Technology, China","institution_ids":["https://openalex.org/I10660446"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045468102","display_name":"Lanxiang Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lanxiang Li","raw_affiliation_strings":["Department of Information and Intelligent Engineering, Yunnan College of Business Management, China"],"raw_orcid":"https://orcid.org/0000-0003-4536-9867","affiliations":[{"raw_affiliation_string":"Department of Information and Intelligent Engineering, Yunnan College of Business Management, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.4119129,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"36","issue":null,"first_page":"82","last_page":"86"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.640467643737793},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5652462244033813},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5009157657623291},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5005433559417725},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.44179999828338623},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24816426634788513},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15290474891662598}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.640467643737793},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5652462244033813},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5009157657623291},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5005433559417725},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.44179999828338623},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24816426634788513},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15290474891662598}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3568199.3568212","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1145/3568199.3568212","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 5th International Conference on Machine Learning and Machine Intelligence","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2072348410","https://openalex.org/W2075457919","https://openalex.org/W2127137315","https://openalex.org/W2393799448"],"related_works":["https://openalex.org/W1968031121","https://openalex.org/W2373085312","https://openalex.org/W2082153276","https://openalex.org/W2889606199","https://openalex.org/W2293063927","https://openalex.org/W2953093056","https://openalex.org/W4297747394","https://openalex.org/W2380776434","https://openalex.org/W2597414233","https://openalex.org/W2900273430"],"abstract_inverted_index":{"The":[0,23],"minimum":[1,30,102,130,158,161],"vertex":[2,31,63,84,103,131],"covering":[3],"problem":[4],"is":[5,52,89,98,110,126,134],"one":[6],"of":[7,34,42,65,71,80,141],"the":[8,29,40,43,47,50,55,62,69,76,81,83,86,92,101,107,113,118,123,129,139,157],"classical":[9],"NP-Hard":[10],"problems":[11],"in":[12,20,54,122],"combinatorial":[13],"optimization,":[14],"which":[15],"has":[16,138],"been":[17],"widely":[18],"used":[19],"practical":[21],"problems.":[22],"existing":[24],"approximation":[25],"algorithms":[26],"for":[27,148],"finding":[28],"cover":[32],"set":[33,133],"a":[35],"general":[36],"graph":[37,44,67,109],"either":[38],"limit":[39],"size":[41],"to":[45,100],"reduce":[46],"complexity,":[48],"or":[49,159],"algorithm":[51,59,137],"blind":[53],"search":[56],"process.":[57],"This":[58,136],"mainly":[60],"combines":[61],"degree":[64,78,88,115],"undirected":[66],"and":[68,96,112,144,150],"idea":[70],"greedy":[72],"algorithm.":[73],"Considering":[74],"from":[75],"highest":[77,87],"node":[79,114,121],"graph,":[82],"with":[85,117],"labeled":[90],"as":[91],"optimal":[93,119],"selection":[94,120],"node,":[95],"it":[97,153],"added":[99],"set.":[104],"Through":[105],"iteration,":[106],"remaining":[108],"reconstructed,":[111],"associated":[116],"previous":[124],"iteration":[125],"recalculated":[127],"until":[128],"coverage":[132],"found.":[135],"characteristics":[140],"fast":[142],"convergence":[143],"high":[145],"efficiency,":[146],"especially":[147],"complex":[149],"large-scale":[151],"images,":[152],"can":[154],"quickly":[155],"obtain":[156],"approximate":[160],"results.":[162]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}