{"id":"https://openalex.org/W2171796957","doi":"https://doi.org/10.1137/s0097539798340047","title":"An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem","display_name":"An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2171796957","doi":"https://doi.org/10.1137/s0097539798340047","mag":"2171796957"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539798340047","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539798340047","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/A5064059676","display_name":"Guy Even","orcid":"https://orcid.org/0000-0001-5407-330X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guy Even","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/A5051756164","display_name":"Leonid Zosin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Leonid Zosin","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.4655,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.70031357,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"30","issue":"4","first_page":"1231","last_page":"1252"},"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.9988999962806702,"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.9988999962806702,"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.9980999827384949,"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.982699990272522,"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.7703851461410522},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7109490036964417},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6964644193649292},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6047351956367493},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5686511397361755},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5634675621986389},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.5542499423027039},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5187606811523438},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.503297746181488},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.49121659994125366},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4829694330692291},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4023769795894623},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40164655447006226},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3701538145542145},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3555757999420166}],"concepts":[{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.7703851461410522},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7109490036964417},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6964644193649292},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6047351956367493},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5686511397361755},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5634675621986389},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.5542499423027039},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5187606811523438},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.503297746181488},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.49121659994125366},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4829694330692291},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4023769795894623},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40164655447006226},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3701538145542145},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3555757999420166},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539798340047","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539798340047","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2015905456","https://openalex.org/W2024517697","https://openalex.org/W2040831377","https://openalex.org/W2072261513","https://openalex.org/W2091004914","https://openalex.org/W2115049345","https://openalex.org/W2150148016","https://openalex.org/W2152986618","https://openalex.org/W4213064273","https://openalex.org/W4244206605"],"related_works":["https://openalex.org/W2079263399","https://openalex.org/W4221167366","https://openalex.org/W1963831867","https://openalex.org/W2024517697","https://openalex.org/W2025716666","https://openalex.org/W2167786517","https://openalex.org/W3029871987","https://openalex.org/W2156098341","https://openalex.org/W2056303072","https://openalex.org/W2037935057"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2,28],"8-approximation":[3],"algorithm":[4,88,134],"for":[5,89],"the":[6,90,108,119],"problem":[7,25,103,114],"of":[8,27,39,60,142,157],"finding":[9],"a":[10,37,64,81,95,139,155],"minimum":[11,82,100,109,120],"weight":[12,83,101,110,121],"subset":[13,38,59],"feedback":[14,111],"vertex":[15,33,112,123],"set":[16,113],"(or":[17],"subset-fvs,":[18],"in":[19,23,115,132],"short).":[20],"The":[21,76,85,99,126],"input":[22],"this":[24],"consists":[26],"undirected":[29,116],"graph":[30],"G=(V,E)":[31],"with":[32,66],"weights":[34],"c(v)":[35],"and":[36,118,135,160],"vertices":[40,61],"S":[41,69],"called":[42,48,63],"special":[43,56],"vertices.":[44],"A":[45,58],"cycle":[46],"is":[47,62,78,138,154],"interesting":[49,74],"if":[50,70],"it":[51,71],"contains":[52],"at":[53],"least":[54],"one":[55],"vertex.":[57],"subset-fvs":[65,102],"respect":[67],"to":[68,79],"intersects":[72],"every":[73],"cycle.":[75],"goal":[77],"find":[80],"subset-fvs.":[84],"best":[86],"previous":[87],"general":[91],"case":[92],"provided":[93],"only":[94],"logarithmic":[96],"approximation":[97],"factor.":[98],"generalizes":[104],"two":[105],"NP-complete":[106],"problems:":[107],"graphs":[117],"multiway":[122],"cut":[124],"problem.":[125],"main":[127],"tool":[128],"that":[129],"we":[130,146],"use":[131],"our":[133],"its":[136],"analysis":[137],"new":[140],"version":[141],"multicommodity":[143,149,152,158],"flow,":[144],"which":[145],"call":[147],"relaxed":[148],"flow.":[150,162],"Relaxed":[151],"flow":[153,159],"hybrid":[156],"multiterminal":[161]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":13}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}