{"id":"https://openalex.org/W2081880478","doi":"https://doi.org/10.1137/s0097539796305109","title":"Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference","display_name":"Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference","publication_year":1998,"publication_date":"1998-08-01","ids":{"openalex":"https://openalex.org/W2081880478","doi":"https://doi.org/10.1137/s0097539796305109","mag":"2081880478"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539796305109","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796305109","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5019016353","display_name":"Reuven Bar-Yehuda","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Reuven Bar-Yehuda","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000414827","display_name":"Dan Geiger","orcid":"https://orcid.org/0000-0001-9988-0199"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dan Geiger","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025400832","display_name":"Joseph Naor","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joseph (Seffi) Naor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5074098103","display_name":"Ron M. Roth","orcid":"https://orcid.org/0000-0003-4168-9505"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ron M. Roth","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":4.9158,"has_fulltext":false,"cited_by_count":185,"citation_normalized_percentile":{"value":0.95401945,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"27","issue":"4","first_page":"942","last_page":"959"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9968000054359436,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7874355316162109},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.748760461807251},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6632287502288818},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5996339321136475},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5544848442077637},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4672517776489258},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46285003423690796},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4096248149871826},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4046427607536316},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3671812117099762}],"concepts":[{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.7874355316162109},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.748760461807251},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6632287502288818},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5996339321136475},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5544848442077637},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4672517776489258},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46285003423690796},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4096248149871826},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4046427607536316},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3671812117099762}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539796305109","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796305109","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.35.5613","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.5613","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/~ronny/PUB/1998/wcc.ps","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":26,"referenced_works":["https://openalex.org/W1524313545","https://openalex.org/W1542492454","https://openalex.org/W1572977974","https://openalex.org/W1991858502","https://openalex.org/W2011039300","https://openalex.org/W2015905456","https://openalex.org/W2020381865","https://openalex.org/W2029483371","https://openalex.org/W2034009564","https://openalex.org/W2040924621","https://openalex.org/W2061734130","https://openalex.org/W2077783414","https://openalex.org/W2085861234","https://openalex.org/W2088188524","https://openalex.org/W2098361906","https://openalex.org/W2143075689","https://openalex.org/W2151720296","https://openalex.org/W2156760067","https://openalex.org/W2159080219","https://openalex.org/W2163322487","https://openalex.org/W2169792341","https://openalex.org/W2332112754","https://openalex.org/W2476096155","https://openalex.org/W2577317768","https://openalex.org/W2984454117","https://openalex.org/W4313198092"],"related_works":["https://openalex.org/W2145212918","https://openalex.org/W2964258819","https://openalex.org/W3003449463","https://openalex.org/W2892180138","https://openalex.org/W2951429970","https://openalex.org/W2742166337","https://openalex.org/W2804969619","https://openalex.org/W4297693688","https://openalex.org/W2963989216","https://openalex.org/W4301100693"],"abstract_inverted_index":{"A":[0],"feedback":[1,49,160],"vertex":[2,17,50,94,161],"set":[3,18,51],"of":[4,11,19,46,52,60,86,116,129,136,147,183,186],"an":[5,26,83],"undirected":[6,27],"graph":[7,28],"is":[8,74,121,138,140,153,164,191],"a":[9,48,78,133,144],"subset":[10,146],"vertices":[12,32,62,190],"that":[13],"intersects":[14],"with":[15,30,54,188],"the":[16,23,44,58,67,96,107,113,141,148,171,181],"each":[20],"cycle":[21],"in":[22,63,110,158,180],"graph.":[24],"Given":[25],"G":[29,53,64],"n":[31],"and":[33],"weights":[34,59],"on":[35],"its":[36],"vertices,":[37,149,152],"polynomial-time":[38],"algorithms":[39,73,168],"are":[40,65],"provided":[41],"for":[42,89,174],"approximating":[43],"problem":[45],"finding":[47],"smallest":[55],"weight.":[56],"When":[57],"all":[61],"equal,":[66],"performance":[68,97,134,173],"ratio":[69,98,120,135],"attained":[70],"by":[71],"these":[72,167],"4-(2/n).":[75],"This":[76],"improves":[77],"previous":[79],"algorithm":[80],"which":[81],"achieved":[82,139],"approximation":[84],"factor":[85],"$O(\\sqrt{\\log":[87],"n})$":[88],"this":[90,119],"case.":[91],"For":[92,112],"general":[93],"weights,":[95],"becomes":[99],"$\\min\\{2\\Delta^2,":[100],"4":[101],"\\log_2":[102],"n\\}$":[103],"where":[104,132,143],"$\\Delta$":[105],"denotes":[106],"maximum":[108],"degree":[109],"G.":[111],"special":[114,127],"case":[115,128],"planar":[117],"graphs":[118,131,187],"reduced":[122],"to":[123,156],"10.":[124],"An":[125,178],"interesting":[126],"weighted":[130],"4-(2/n)":[137],"one":[142],"prescribed":[145],"so-called":[150],"blackout":[151,189],"not":[154],"allowed":[155],"participate":[157],"any":[159],"set.":[162],"It":[163],"shown":[165],"how":[166],"can":[169],"improve":[170],"search":[172],"constraint":[175],"satisfaction":[176],"problems.":[177],"application":[179],"area":[182],"Bayesian":[184],"inference":[185],"also":[192],"presented.":[193]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":39},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":16}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}