{"id":"https://openalex.org/W3120650971","doi":"https://doi.org/10.14569/ijacsa.2020.0111232","title":"A Smart Approximation Algorithm for Minimum Vertex Cover Problem based on Min-to-Min (MtM) Strategy","display_name":"A Smart Approximation Algorithm for Minimum Vertex Cover Problem based on Min-to-Min (MtM) Strategy","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3120650971","doi":"https://doi.org/10.14569/ijacsa.2020.0111232","mag":"3120650971"},"language":"en","primary_location":{"id":"doi:10.14569/ijacsa.2020.0111232","doi":"https://doi.org/10.14569/ijacsa.2020.0111232","is_oa":true,"landing_page_url":"https://doi.org/10.14569/ijacsa.2020.0111232","pdf_url":"http://thesai.org/Downloads/Volume11No12/Paper_32-A_Smart_Approximation_Algorithm.pdf","source":{"id":"https://openalex.org/S23629721","display_name":"International Journal of Advanced Computer Science and Applications","issn_l":"2156-5570","issn":["2156-5570","2158-107X"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","norway-1","poland-20","russia-white-list-3","vabb-shw"],"host_organization":"https://openalex.org/P4310311819","host_organization_name":"Science and Information Organization","host_organization_lineage":["https://openalex.org/P4310311819"],"host_organization_lineage_names":["Science and Information Organization"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Advanced Computer Science and Applications","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://thesai.org/Downloads/Volume11No12/Paper_32-A_Smart_Approximation_Algorithm.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084175262","display_name":"Jawad Haider","orcid":"https://orcid.org/0000-0002-4769-2468","observed_orcids":["https://orcid.org/0000-0002-4769-2468"]},"institutions":[{"id":"https://openalex.org/I110346614","display_name":"University of Central Asia","ror":"https://ror.org/04rrs4x54","country_code":"KG","type":"education","lineage":["https://openalex.org/I110346614"]}],"countries":["KG"],"is_corresponding":false,"raw_author_name":"Jawad Haider","raw_affiliation_strings":["Department of Computer Science University of Central Asia Naryn 722918, Kyrgyzstan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science University of Central Asia Naryn 722918, Kyrgyzstan","institution_ids":["https://openalex.org/I110346614"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008406878","display_name":"Muhammad Fayaz","orcid":"https://orcid.org/0000-0001-6099-1967","observed_orcids":["https://orcid.org/0000-0001-6099-1967","https://orcid.org/0000-0002-7699-9426"]},"institutions":[{"id":"https://openalex.org/I110346614","display_name":"University of Central Asia","ror":"https://ror.org/04rrs4x54","country_code":"KG","type":"education","lineage":["https://openalex.org/I110346614"]}],"countries":["KG"],"is_corresponding":false,"raw_author_name":"Muhammad Fayaz","raw_affiliation_strings":["Department of Computer Science University of Central Asia Naryn 722918, Kyrgyzstan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science University of Central Asia Naryn 722918, Kyrgyzstan","institution_ids":["https://openalex.org/I110346614"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I110346614"],"apc_list":null,"apc_paid":null,"fwci":0.1988,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.38506598,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":"11","issue":"12","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9868000149726868,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9868000149726868,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.01209999993443489,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":9.999999747378752e-05,"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/minimum-vertex-cover","display_name":"minimum vertex cover","score":0.9739999771118164},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8090000152587891},{"id":"https://openalex.org/keywords/maximum-independent-set-problem","display_name":"maximum independent set","score":0.9309999942779541},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.39399999380111694}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8060098886489868},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6744536757469177},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.6671057343482971},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5776926875114441},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.5504876971244812},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5442010760307312},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5152073502540588},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4879907965660095},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.44622981548309326},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3379175066947937},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3077148497104645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3064735233783722},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1561768651008606},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.14569/ijacsa.2020.0111232","doi":"https://doi.org/10.14569/ijacsa.2020.0111232","is_oa":true,"landing_page_url":"https://doi.org/10.14569/ijacsa.2020.0111232","pdf_url":"http://thesai.org/Downloads/Volume11No12/Paper_32-A_Smart_Approximation_Algorithm.pdf","source":{"id":"https://openalex.org/S23629721","display_name":"International Journal of Advanced Computer Science and Applications","issn_l":"2156-5570","issn":["2156-5570","2158-107X"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","norway-1","poland-20","russia-white-list-3","vabb-shw"],"host_organization":"https://openalex.org/P4310311819","host_organization_name":"Science and Information Organization","host_organization_lineage":["https://openalex.org/P4310311819"],"host_organization_lineage_names":["Science and Information Organization"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Advanced Computer Science and Applications","raw_type":"journal-article"},{"id":"pmh:oai:thesai.org:fef5cabd-80fe-46d3-aca9-ece0cc0eec4c","doi":null,"is_oa":true,"landing_page_url":"https://thesai.org/Publications/ViewPaper?Volume=11&Issue=12&Code=IJACSA&SerialNo=32","pdf_url":"https://thesai.org/Downloads/Volume11No12/Paper_32-A_Smart_Approximation_Algorithm.pdf","source":{"id":"https://openalex.org/S23629721","display_name":"International Journal of Advanced Computer Science and Applications","issn_l":"2156-5570","issn":["2156-5570","2158-107X"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","norway-1","poland-20","russia-white-list-3","vabb-shw"],"host_organization":"https://openalex.org/P4310311819","host_organization_name":"Science and Information Organization","host_organization_lineage":["https://openalex.org/P4310311819"],"host_organization_lineage_names":["Science and Information Organization"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Advanced Computer Science and Applications, Vol. 11, No. 12 (2020), ISSN 2158-107X","raw_type":"text"}],"best_oa_location":{"id":"doi:10.14569/ijacsa.2020.0111232","doi":"https://doi.org/10.14569/ijacsa.2020.0111232","is_oa":true,"landing_page_url":"https://doi.org/10.14569/ijacsa.2020.0111232","pdf_url":"http://thesai.org/Downloads/Volume11No12/Paper_32-A_Smart_Approximation_Algorithm.pdf","source":{"id":"https://openalex.org/S23629721","display_name":"International Journal of Advanced Computer Science and Applications","issn_l":"2156-5570","issn":["2156-5570","2158-107X"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","norway-1","poland-20","russia-white-list-3","vabb-shw"],"host_organization":"https://openalex.org/P4310311819","host_organization_name":"Science and Information Organization","host_organization_lineage":["https://openalex.org/P4310311819"],"host_organization_lineage_names":["Science and Information Organization"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Advanced Computer Science and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3120650971.pdf","grobid_xml":"https://content.openalex.org/works/W3120650971.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W587794248","https://openalex.org/W1479863711","https://openalex.org/W1509289098","https://openalex.org/W1510746324","https://openalex.org/W1519655831","https://openalex.org/W1525605957","https://openalex.org/W1544357472","https://openalex.org/W1607530841","https://openalex.org/W1974811277","https://openalex.org/W2011039300","https://openalex.org/W2020681752","https://openalex.org/W2026320281","https://openalex.org/W2036265926","https://openalex.org/W2047009939","https://openalex.org/W2053867237","https://openalex.org/W2055570077","https://openalex.org/W2067435011","https://openalex.org/W2115941896","https://openalex.org/W2117942072","https://openalex.org/W2157054705","https://openalex.org/W2184495293","https://openalex.org/W2290596394","https://openalex.org/W2292258317","https://openalex.org/W2312627952","https://openalex.org/W2401610261","https://openalex.org/W2405404538","https://openalex.org/W2788320394","https://openalex.org/W2921609704","https://openalex.org/W2950295097","https://openalex.org/W2986575288","https://openalex.org/W3144989609","https://openalex.org/W4296590948","https://openalex.org/W6631722374"],"related_works":["https://openalex.org/W2292258317","https://openalex.org/W2594442438","https://openalex.org/W2579422054","https://openalex.org/W2292810008","https://openalex.org/W2339362981","https://openalex.org/W2115941896","https://openalex.org/W2364222140","https://openalex.org/W6903758781","https://openalex.org/W2290596394","https://openalex.org/W2576210528"],"abstract_inverted_index":{"In":[0,12,46,100],"this":[1],"paper,":[2],"we":[3],"have":[4,199],"proposed":[5,14,142,156,203],"an":[6],"algorithm":[7,15,143,158,180],"based":[8],"on":[9,161,166],"min-to-min":[10,157,179],"approach.":[11],"the":[13,17,23,28,38,41,47,50,55,58,66,74,77,83,90,96,105,108,116,137,171,175,178,187,202,207],"first":[16],"degree":[18,32,43,52,60,78,110,118,129],"of":[19,22,40,49,79,82,102,107,122,177,193],"each":[20,80],"vertex":[21,29,56,69,81,119,128],"graph":[24,85,97,138],"is":[25,33,61,86,93,124,134,144,159,181],"calculated.":[26],"Next":[27],"with":[30,57],"minimum":[31,42,51,59,68,109,117,127],"selected,":[34],"after":[35],"which":[36],"all":[37,104,121],"neighbors":[39,48,106],"are":[44,112],"located.":[45],"vertex,":[53],"again":[54,89],"found":[62],"and":[63,71,88,114,149,153,170,195],"put":[64],"into":[65],"set":[67,210],"cover":[70],"deleted":[72],"from":[73],"graph.":[75],"Again,":[76],"updated":[84],"calculated":[87],"same":[91,132],"process":[92,133],"repeated":[94,135],"until":[95,136],"becomes":[98,139],"empty.":[99,140],"case":[101],"tie,":[103],"vertices":[111],"computed":[113],"then":[115],"in":[120,191],"them":[123],"added":[125],"to":[126,151,186,205],"set.":[130],"The":[131,141,155],"a":[145],"very":[146],"simple,":[147],"efficient,":[148],"easy":[150],"understand":[152],"implement.":[154],"evaluated":[160],"small":[162],"as":[163,165,184],"well":[164],"large":[167],"benchmark":[168],"instances":[169],"results":[172],"indicate":[173],"that":[174],"performance":[176],"far":[182],"better":[183],"compared":[185],"other":[188],"state-of-art":[189],"algorithms":[190],"term":[192],"accuracy":[194],"computation":[196],"complexity.":[197],"We":[198],"also":[200],"used":[201],"method":[204],"solve":[206],"maximum":[208],"independent":[209],"problem.":[211]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2021-01-18T00:00:00"}