{"id":"https://openalex.org/W2166369652","doi":"https://doi.org/10.1109/ccc.2009.38","title":"Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs","display_name":"Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs","publication_year":2009,"publication_date":"2009-07-01","ids":{"openalex":"https://openalex.org/W2166369652","doi":"https://doi.org/10.1109/ccc.2009.38","mag":"2166369652"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2009.38","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5055776088","display_name":"Per Austrin","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"funder","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Per Austrin","raw_affiliation_strings":["Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067917669","display_name":"Subhash Khot","orcid":"https://orcid.org/0009-0007-9246-4011"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"funder","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Subhash Khot","raw_affiliation_strings":["New York University, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"New York University, New York, NY, USA","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007318528","display_name":"Muli Safra","orcid":"https://orcid.org/0000-0002-5022-7727"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"funder","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Muli Safra","raw_affiliation_strings":["Tel-Aviv University, Tel-Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institution_assertions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.231,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":63,"citation_normalized_percentile":{"value":0.999377,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"74","last_page":"80"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9999,"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.9999,"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.9981,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9951,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/vertex-cover","display_name":"Vertex cover","score":0.5734333},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5021944}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6846078},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.66927975},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6505388},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5734333},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.55216336},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5021944},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47518814},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.44368094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42820257},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39295748},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.38235223},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31592888},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20417762},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09923804},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2009.38","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":24,"referenced_works":["https://openalex.org/W1483324665","https://openalex.org/W1514622459","https://openalex.org/W1859357731","https://openalex.org/W1971749164","https://openalex.org/W1975810219","https://openalex.org/W2004804919","https://openalex.org/W2014086530","https://openalex.org/W2017052164","https://openalex.org/W2030970869","https://openalex.org/W2047861934","https://openalex.org/W2074465184","https://openalex.org/W2078929687","https://openalex.org/W2081254453","https://openalex.org/W2087038607","https://openalex.org/W2091921997","https://openalex.org/W2103649698","https://openalex.org/W2120358419","https://openalex.org/W2125240990","https://openalex.org/W2137118456","https://openalex.org/W2143698439","https://openalex.org/W2152490496","https://openalex.org/W2162117620","https://openalex.org/W2964070965","https://openalex.org/W4242357733"],"related_works":["https://openalex.org/W3102280101","https://openalex.org/W2551034790","https://openalex.org/W2538178083","https://openalex.org/W2096382750","https://openalex.org/W2094388041","https://openalex.org/W2056597184","https://openalex.org/W2029933769","https://openalex.org/W1712180277","https://openalex.org/W1608414128","https://openalex.org/W159504299"],"abstract_inverted_index":{"We":[0,14],"study":[1],"the":[2,45,52,78,99],"inapproximability":[3],"of":[4,48,88,101],"Vertex":[5,18],"Cover":[6,19],"and":[7,90],"Independent":[8,60],"Set":[9,61],"on":[10,98],"degree":[11],"d":[12],"graphs.":[13],"prove":[15],"that:":[16],"(1)":[17,57],"is":[20,62],"Unique":[21,63,84],"Games-hard":[22,64],"to":[23,25,51,65,67],"approximate":[24,66],"within":[26,68],"a":[27,69,102],"factor":[28,70],"2":[29],"-":[30],"(2":[31],"+":[32],"o":[33,53],"d":[36,56],"(1))":[37],"log":[38,39],"d/log":[40,79],"d.":[41],"This":[42,76],"exactly":[43],"matches":[44],"algorithmic":[46],"result":[47,87,94],"Halperin":[49],"up":[50],"term.":[58],"(2)":[59],"O(d/log":[71],"2":[74],"d).":[75],"improves":[77],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">O(1)":[82],"(d))":[83],"Games":[85],"hardness":[86],"Samorodnitsky":[89],"Trevisan.":[91],"Additionally,":[92],"our":[93],"does":[95],"not":[96],"rely":[97],"construction":[100],"query":[103],"efficient":[104],"PCP":[105],"as":[106],"in.":[107]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2166369652","counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":9}],"updated_date":"2025-03-18T21:10:17.873240","created_date":"2016-06-24"}