{"id":"https://openalex.org/W2583426397","doi":"https://doi.org/10.4086/toc.2016.v012a006","title":"","display_name":"","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2583426397","doi":"https://doi.org/10.4086/toc.2016.v012a006","mag":"2583426397"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2016.v012a006","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2016.v012a006","pdf_url":"http://www.theoryofcomputing.org/articles/v012a006/v012a006.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.theoryofcomputing.org/articles/v012a006/v012a006.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5075423314","display_name":"Euiwoong Lee","orcid":"https://orcid.org/0000-0003-1454-7587"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Euiwoong Lee","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":1.4461,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.85870879,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"12","issue":"1","first_page":"1","last_page":"11"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9962999820709229,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.993399977684021,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6549718379974365},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6150336265563965},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.610919177532196},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5980778932571411},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5566577911376953},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.5352855920791626},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4697682559490204},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44772180914878845},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44218388199806213},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44042670726776123},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22430291771888733}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6549718379974365},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6150336265563965},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.610919177532196},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5980778932571411},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5566577911376953},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.5352855920791626},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4697682559490204},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44772180914878845},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44218388199806213},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44042670726776123},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22430291771888733},{"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.4086/toc.2016.v012a006","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2016.v012a006","pdf_url":"http://www.theoryofcomputing.org/articles/v012a006/v012a006.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2016.v012a006","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2016.v012a006","pdf_url":"http://www.theoryofcomputing.org/articles/v012a006/v012a006.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320332195","display_name":"Samsung","ror":"https://ror.org/04w3jy968"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2583426397.pdf","grobid_xml":"https://content.openalex.org/works/W2583426397.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W1846185267","https://openalex.org/W1859357731","https://openalex.org/W1973898585","https://openalex.org/W1990800802","https://openalex.org/W2015905456","https://openalex.org/W2016590962","https://openalex.org/W2040831377","https://openalex.org/W2043520568","https://openalex.org/W2056590617","https://openalex.org/W2070745908","https://openalex.org/W2091977535","https://openalex.org/W2098361906","https://openalex.org/W2117372120","https://openalex.org/W2120358419","https://openalex.org/W2137118456","https://openalex.org/W2143698439","https://openalex.org/W2568407640","https://openalex.org/W4226347946"],"related_works":["https://openalex.org/W2145212918","https://openalex.org/W2892180138","https://openalex.org/W2951429970","https://openalex.org/W2536906705","https://openalex.org/W2351427475","https://openalex.org/W4387914616","https://openalex.org/W2004969038","https://openalex.org/W2077115523","https://openalex.org/W1985300267","https://openalex.org/W2386691237"],"abstract_inverted_index":{"The":[0],"Feedback":[1,64],"Vertex":[2,65],"Set":[3,66],"problem":[4],"(FVS),":[5],"where":[6],"the":[7,28,53],"goal":[8],"is":[9,26,33,49,67],"to":[10,69],"find":[11,40],"a":[12,60],"small":[13],"subset":[14],"of":[15],"vertices":[16],"that":[17,63],"intersects":[18],"every":[19],"cycle":[20],"in":[21],"an":[22,41],"input":[23],"directed":[24],"graph,":[25],"among":[27],"fundamental":[29],"problems":[30],"whose":[31],"approximability":[32],"not":[34],"well":[35],"understood.":[36],"One":[37],"can":[38],"efficiently":[39],"O(log":[42],"n)factor":[43],"approximation,":[44],"and":[45],"efficient":[46],"constant-factor":[47],"approximation":[48],"ruled":[50],"out":[51],"under":[52],"Unique":[54],"Games":[55],"Conjecture":[56],"(UGC).":[57],"We":[58],"give":[59],"simpler":[61],"proof":[62],"hard":[68],"approximate":[70],"within":[71],"any":[72],"constant":[73],"factor,":[74],"assuming":[75],"UGC.":[76]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2025-12-17T22:08:43.090829","created_date":"2017-02-10T00:00:00"}