{"id":"https://openalex.org/W2024517697","doi":"https://doi.org/10.1137/s0895480196305124","title":"A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem","display_name":"A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2024517697","doi":"https://doi.org/10.1137/s0895480196305124","mag":"2024517697"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480196305124","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480196305124","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5028801735","display_name":"Vineet Bafna","orcid":"https://orcid.org/0000-0002-5810-6241"},"institutions":[{"id":"https://openalex.org/I2799411422","display_name":"Center for Discrete Mathematics and Theoretical Computer Science","ror":"https://ror.org/00k551w06","country_code":"US","type":"facility","lineage":["https://openalex.org/I102322142","https://openalex.org/I118347220","https://openalex.org/I1283103587","https://openalex.org/I1311060795","https://openalex.org/I20089843","https://openalex.org/I2799411422","https://openalex.org/I4210107353"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vineet Bafna","raw_affiliation_strings":["DIMACS Center"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DIMACS Center","institution_ids":["https://openalex.org/I2799411422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023910624","display_name":"Piotr Berman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Piotr Berman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","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":false,"raw_author_name":"Toshihiro Fujito","raw_affiliation_strings":["Hiroshima University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hiroshima University","institution_ids":["https://openalex.org/I113306721"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.7568,"has_fulltext":false,"cited_by_count":349,"citation_normalized_percentile":{"value":0.97651815,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"12","issue":"3","first_page":"289","last_page":"297"},"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.9998999834060669,"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.9998999834060669,"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.9987999796867371,"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.9973000288009644,"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/feedback-vertex-set","display_name":"Feedback vertex set","score":0.8563253879547119},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.8422293066978455},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7295163869857788},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.7143007516860962},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6825885772705078},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6708913445472717},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6234334707260132},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.6061843037605286},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.5622041821479797},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.4678319990634918},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41617411375045776},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4122158885002136},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.17228999733924866},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.09144949913024902}],"concepts":[{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.8563253879547119},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8422293066978455},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7295163869857788},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.7143007516860962},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6825885772705078},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6708913445472717},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6234334707260132},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.6061843037605286},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.5622041821479797},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.4678319990634918},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41617411375045776},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4122158885002136},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17228999733924866},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.09144949913024902},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0895480196305124","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480196305124","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.244.9985","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.244.9985","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.technion.ac.il/%7Ereuven/SAVE/OTHERS/vfs_bafna.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1512015032","https://openalex.org/W1517065489","https://openalex.org/W1572977974","https://openalex.org/W1975442866","https://openalex.org/W2004181701","https://openalex.org/W2011039300","https://openalex.org/W2014981179","https://openalex.org/W2038225707","https://openalex.org/W2041605864","https://openalex.org/W2081880478","https://openalex.org/W2143391442","https://openalex.org/W2163269124","https://openalex.org/W2577317768","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2156896570","https://openalex.org/W1566660502","https://openalex.org/W2024517697","https://openalex.org/W2079263399","https://openalex.org/W1560183925","https://openalex.org/W2173656554","https://openalex.org/W2963350429","https://openalex.org/W4302317037","https://openalex.org/W2048322630","https://openalex.org/W2405126695"],"abstract_inverted_index":{"A":[0],"feedback":[1,33],"vertex":[2,17,34,84,114],"set":[3,35],"of":[4,10,29,53,67,102,112,122],"a":[5,8,31,37,44,99,118],"graph":[6],"is":[7,27,87,96],"subset":[9],"vertices":[11],"that":[12,28],"contains":[13],"at":[14,54],"least":[15],"one":[16],"from":[18],"every":[19],"cycle":[20],"in":[21],"the":[22,68,77,83,94,103,113],"graph.":[23,41],"The":[24,90],"problem":[25],"considered":[26],"finding":[30],"minimum":[32],"given":[36],"weighted":[38,63],"and":[39,46,117],"undirected":[40],"We":[42],"present":[43],"simple":[45],"efficient":[47],"approximation":[48,91,111],"algorithm":[49],"with":[50],"performance":[51],"ratio":[52,106],"most":[55],"2,":[56],"improving":[57],"previous":[58],"best":[59,78],"bounds":[60],"for":[61,82,110],"either":[62],"or":[64],"unweighted":[65],"cases":[66],"problem.":[69],"Any":[70],"further":[71],"improvement":[72],"on":[73,98],"this":[74],"bound,":[75],"matching":[76],"constant":[79],"factor":[80],"known":[81],"cover":[85,115],"problem,":[86,116],"deemed":[88],"challenging.":[89],"principle,":[92],"underlying":[93],"algorithm,":[95],"based":[97],"generalized":[100],"form":[101],"classical":[104],"local":[105],"theorem,":[107],"originally":[108],"developed":[109],"more":[119],"flexible":[120],"style":[121],"its":[123],"application.":[124]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":50},{"year":2017,"cited_by_count":18},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":20},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":28}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}