{"id":"https://openalex.org/W56767668","doi":null,"title":"Constant Ratio Approximations of Feedback Vertex Sets in Weighted Undirected Graphs","display_name":"Constant Ratio Approximations of Feedback Vertex Sets in Weighted Undirected Graphs","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W56767668","mag":"56767668"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.422.776","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.776","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/~reuven/SAVE/OTHERS/vfs_lr.pdf","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"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","observed_orcids":["https://orcid.org/0000-0002-5810-6241"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vineet Bafna","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Piotr Berman","orcid":null,"observed_orcids":[]},"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","observed_orcids":["https://orcid.org/0000-0001-7892-6426"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Toshihiro Fujito","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00940083,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"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.9398999810218811,"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.9398999810218811,"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.05950000137090683,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9860000014305115},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.7540000081062317},{"id":"https://openalex.org/keywords/weighted-undirected-graphs","display_name":"weighted undirected graphs","score":0.9470000267028809},{"id":"https://openalex.org/keywords/vertex-cover-problem","display_name":"vertex cover","score":0.8669999837875366},{"id":"https://openalex.org/keywords/approximation-preserving-reductions","display_name":"approximation-preserving reductions","score":0.8759999871253967},{"id":"https://openalex.org/keywords/bounded-degree-graphs","display_name":"bounded degree graphs","score":0.8510000109672546},{"id":"https://openalex.org/keywords/cycle-elimination","display_name":"cycle elimination","score":0.3310000002384186}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6656453609466553},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5945864319801331},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5688333511352539},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5497017502784729},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4987061023712158},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.44259461760520935},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35564637184143066},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3164325952529907},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27156758308410645},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.422.776","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.776","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/~reuven/SAVE/OTHERS/vfs_lr.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.56.6165","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.6165","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1996/96-29.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2024517697","https://openalex.org/W7096885578","https://openalex.org/W2098361906","https://openalex.org/W7097301226","https://openalex.org/W7095258444","https://openalex.org/W2079730540","https://openalex.org/W7098463588","https://openalex.org/W2280164164","https://openalex.org/W2577317768","https://openalex.org/W2098464890"],"abstract_inverted_index":{"A":[0],"feedback":[1,28,89],"vertex":[2,17,29,61,84,90,115],"set":[3,30,91],"of":[4,10,77,82,97,113,136,148,154],"a":[5,8,27,32,36,145],"graph":[6],"is":[7,132],"subset":[9],"vertices":[11],"that":[12,26,94,119],"contains":[13],"at":[14],"least":[15],"one":[16,34],"from":[18],"every":[19],"cycle":[20],"in":[21,43],"the":[22,48,53,60,65,83,88,98,133,149],"graph.":[23],"We":[24,106],"show":[25,118],"approximating":[31],"minimum":[33],"within":[35],"constant":[37,55],"factor":[38],"can":[39],"be":[40],"efficiently":[41],"found":[42],"undirected":[44],"graphs.":[45,137],"In":[46],"fact":[47],"derived":[49],"approximation":[50,79,139],"ratio":[51,56,100,152],"matches":[52],"best":[54,67],"known":[57],"today":[58],"for":[59,69],"cover":[62,85],"problem,":[63],"improving":[64],"previous":[66],"results":[68],"both":[70],"weighted":[71],"and":[72,117,156],"unweighted":[73],"cases.":[74],"The":[75],"existence":[76],"an":[78],"preserving":[80],"reduction":[81],"problem":[86,92],"to":[87,110],"suggests":[93],"further":[95],"improvement":[96],"obtained":[99,142],"will":[101],"require":[102],"entirely":[103],"new":[104],"ideas.":[105],"extend":[107],"our":[108],"approach":[109],"handle":[111],"graphs":[112],"bounded":[114],"degree,":[116],"it":[120],"achieves":[121],"even":[122],"better":[123],"performance,":[124],"2":[125,127],"0":[126],"3102":[128],",":[129],"where":[130],"1":[131],"maximum":[134],"degree":[135],"These":[138],"bounds":[140],"are":[141],"by":[143],"using":[144],"non-trivial":[146],"generalization":[147],"classical":[150],"local":[151],"principle":[153],"Bar--Yehuda":[155],"Even.":[157]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-27T00:00:00"}