{"id":"https://openalex.org/W2079730540","doi":"https://doi.org/10.1016/0020-0190(96)00094-4","title":"A note on approximation of the vertex cover and feedback vertex set problems \u2014 Unified approach","display_name":"A note on approximation of the vertex cover and feedback vertex set problems \u2014 Unified approach","publication_year":1996,"publication_date":"1996-07-01","ids":{"openalex":"https://openalex.org/W2079730540","doi":"https://doi.org/10.1016/0020-0190(96)00094-4","mag":"2079730540"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(96)00094-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(96)00094-4","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-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/A5006109156","display_name":"Toshihiro Fujito","orcid":"https://orcid.org/0000-0001-7892-6426"},"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":"Toshihiro Fujito","raw_affiliation_strings":["Department of Electrical Engineering, Faculty of Engineering, Hiroshima University, 1-4-1 Kagamiyama, Higashi, Hiroshima 739, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Faculty of Engineering, Hiroshima University, 1-4-1 Kagamiyama, Higashi, Hiroshima 739, Japan","institution_ids":["https://openalex.org/I113306721"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5006109156"],"corresponding_institution_ids":["https://openalex.org/I113306721"],"apc_list":{"value":2040,"currency":"USD","value_usd":2040},"apc_paid":null,"fwci":0.49,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.67070096,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"59","issue":"2","first_page":"59","last_page":"63"},"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.9998000264167786,"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.9998000264167786,"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.9983000159263611,"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/T12288","display_name":"Optimization and Search Problems","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9251946210861206},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.8577825427055359},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7393268942832947},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6557632684707642},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.6106006503105164},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5379406213760376},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5025269985198975},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.4886322617530823},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.47007161378860474},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4684318006038666},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.46587157249450684},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44565534591674805},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.43170446157455444},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42689594626426697},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.422580748796463},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4125921130180359},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3758993148803711},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.309913694858551},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2820073366165161},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2533819079399109},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2481236755847931},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.09616288542747498},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.059156715869903564}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.9251946210861206},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.8577825427055359},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7393268942832947},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6557632684707642},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.6106006503105164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5379406213760376},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5025269985198975},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.4886322617530823},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.47007161378860474},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4684318006038666},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.46587157249450684},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44565534591674805},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.43170446157455444},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42689594626426697},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.422580748796463},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4125921130180359},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3758993148803711},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.309913694858551},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2820073366165161},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2533819079399109},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2481236755847931},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.09616288542747498},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.059156715869903564},{"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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(96)00094-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(96)00094-4","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1572977974","https://openalex.org/W2038225707","https://openalex.org/W2041605864","https://openalex.org/W2056452950","https://openalex.org/W2066356146","https://openalex.org/W2098361906","https://openalex.org/W2143391442","https://openalex.org/W2401610261","https://openalex.org/W2577317768","https://openalex.org/W6634222898","https://openalex.org/W6644040475","https://openalex.org/W6664492399","https://openalex.org/W6674548932","https://openalex.org/W6681300758","https://openalex.org/W6732830485"],"related_works":["https://openalex.org/W2112112676","https://openalex.org/W2108073487","https://openalex.org/W2359923140","https://openalex.org/W1966805076","https://openalex.org/W2079730540","https://openalex.org/W2551034790","https://openalex.org/W1848055413","https://openalex.org/W2963350429","https://openalex.org/W4302317037","https://openalex.org/W4390589815"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}