{"id":"https://openalex.org/W2056303072","doi":"https://doi.org/10.1109/iscas.2012.6272111","title":"Performance comparison of approximation algorithms for the minimum weight vertex cover problem","display_name":"Performance comparison of approximation algorithms for the minimum weight vertex cover problem","publication_year":2012,"publication_date":"2012-05-01","ids":{"openalex":"https://openalex.org/W2056303072","doi":"https://doi.org/10.1109/iscas.2012.6272111","mag":"2056303072"},"language":"en","primary_location":{"id":"doi:10.1109/iscas.2012.6272111","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2012.6272111","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Circuits and Systems","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/A5054096253","display_name":"Satoshi Taoka","orcid":null},"institutions":[{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Satoshi Taoka","raw_affiliation_strings":["Graduate School of Engineering, Hiroshima University, Higashihiroshima, Japan","Graduate School of Engineering, Hiroshima University, 1-4-1 Kagamiyama, Higashi-Hiroshima 739-8527 Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Engineering, Hiroshima University, Higashihiroshima, Japan","institution_ids":["https://openalex.org/I113306721"]},{"raw_affiliation_string":"Graduate School of Engineering, Hiroshima University, 1-4-1 Kagamiyama, Higashi-Hiroshima 739-8527 Japan","institution_ids":["https://openalex.org/I113306721"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101058819","display_name":"Toshimasa Watanabe","orcid":null},"institutions":[{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Toshimasa Watanabe","raw_affiliation_strings":["Graduate School of Engineering, Hiroshima University, Higashihiroshima, Japan","Graduate School of Engineering, Hiroshima University, 1-4-1 Kagamiyama, Higashi-Hiroshima 739-8527 Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Engineering, Hiroshima University, Higashihiroshima, Japan","institution_ids":["https://openalex.org/I113306721"]},{"raw_affiliation_string":"Graduate School of Engineering, Hiroshima University, 1-4-1 Kagamiyama, Higashi-Hiroshima 739-8527 Japan","institution_ids":["https://openalex.org/I113306721"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054096253"],"corresponding_institution_ids":["https://openalex.org/I113306721"],"apc_list":null,"apc_paid":null,"fwci":1.3478,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.81163295,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"632","last_page":"635"},"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.9995999932289124,"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.9995999932289124,"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.9977999925613403,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.993399977684021,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.9025170207023621},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.8396222591400146},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6816476583480835},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6802603602409363},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5522847771644592},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.547235369682312},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5411945581436157},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5394210815429688},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5143293142318726},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.47634246945381165},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.379115492105484},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32834184169769287}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.9025170207023621},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.8396222591400146},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6816476583480835},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6802603602409363},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5522847771644592},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.547235369682312},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5411945581436157},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5394210815429688},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5143293142318726},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.47634246945381165},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.379115492105484},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32834184169769287},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscas.2012.6272111","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2012.6272111","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Circuits and Systems","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":18,"referenced_works":["https://openalex.org/W165772547","https://openalex.org/W1559144499","https://openalex.org/W1562924199","https://openalex.org/W1572977974","https://openalex.org/W1990313671","https://openalex.org/W2011039300","https://openalex.org/W2013415302","https://openalex.org/W2028146345","https://openalex.org/W2030970869","https://openalex.org/W2041605864","https://openalex.org/W2041995230","https://openalex.org/W2055687752","https://openalex.org/W2064600658","https://openalex.org/W2079699445","https://openalex.org/W2088188524","https://openalex.org/W2151015304","https://openalex.org/W2476096155","https://openalex.org/W6606800880"],"related_works":["https://openalex.org/W2156896570","https://openalex.org/W1566660502","https://openalex.org/W2025716666","https://openalex.org/W1963831867","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W3029871987","https://openalex.org/W2167786517","https://openalex.org/W2125212169","https://openalex.org/W2037935057"],"abstract_inverted_index":{"A":[0],"vertex":[1,35,47,63],"cover":[2,36,48],"of":[3,15,30,44,50,65,72,77,89,92],"a":[4,12,46,95],"given":[5,52],"graph":[6,53],"G":[7,54],"=":[8,55],"(V,":[9,56],"E)":[10],"is":[11,41,79],"subset":[13],"N":[14,19,49,78],"V":[16,93],"such":[17,67],"that":[18,68],"contains":[20],"either":[21],"u":[22],"or":[23],"v":[24,64,76,91],"for":[25,39,61],"any":[26,51,90],"edge":[27],"(u,":[28],"v)":[29],"E.":[31],"The":[32],"minimum":[33],"weight":[34,59],"problem":[37,43],"(MWVC":[38],"short)":[40],"the":[42,69],"finding":[45],"E),":[57],"with":[58,87],"w(v)":[60,73,88],"each":[62],"V,":[66],"sum":[70],"w(N)":[71],"over":[74],"all":[75],"minimum.":[80],"In":[81],"this":[82],"paper,":[83],"we":[84],"consider":[85],"MWVC":[86],"being":[94],"positive":[96],"integer.":[97],"Five":[98],"existing":[99],"approximation":[100],"algorithms":[101],"are":[102,106],"implemented,":[103],"and":[104],"they":[105],"evaluated":[107],"through":[108],"computing":[109],"experiment.":[110]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}