{"id":"https://openalex.org/W1524356573","doi":"https://doi.org/10.1109/ccc.2003.1214437","title":"Vertex cover might be hard to approximate to within 2-\u03b5","display_name":"Vertex cover might be hard to approximate to within 2-\u03b5","publication_year":2004,"publication_date":"2004-01-23","ids":{"openalex":"https://openalex.org/W1524356573","doi":"https://doi.org/10.1109/ccc.2003.1214437","mag":"1524356573"},"language":"en","primary_location":{"id":"doi:10.1109/ccc.2003.1214437","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2003.1214437","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5067917669","display_name":"Subhash Khot","orcid":"https://orcid.org/0009-0007-9246-4011"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Khot","raw_affiliation_strings":["Department of Computer Science, Princeton University, Princeton, NJ, USA","Dept. of Computer Sci., Princeton Univ., NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Dept. of Computer Sci., Princeton Univ., NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108189093","display_name":"Oded Regev","orcid":null},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"O. Regev","raw_affiliation_strings":["Institute of Advanced Study in Science and Technology, Princeton, NJ, USA","[Institute of Advanced Study in Science and Technology, Princeton, NJ, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Advanced Study in Science and Technology, Princeton, NJ, USA","institution_ids":["https://openalex.org/I40036882"]},{"raw_affiliation_string":"[Institute of Advanced Study in Science and Technology, Princeton, NJ, USA]","institution_ids":["https://openalex.org/I40036882"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":98,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"379","last_page":"386"},"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.9998999834060669,"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.9998999834060669,"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.9976999759674072,"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.9941999912261963,"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/vertex-cover","display_name":"Vertex cover","score":0.8848850727081299},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7785532474517822},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.7458673715591431},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6017215251922607},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5938926935195923},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4682427644729614},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4575883150100708},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39366453886032104},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3479611277580261},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.27170535922050476},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11033907532691956},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09033742547035217}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8848850727081299},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7785532474517822},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.7458673715591431},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6017215251922607},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5938926935195923},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4682427644729614},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4575883150100708},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39366453886032104},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3479611277580261},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27170535922050476},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11033907532691956},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09033742547035217},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ccc.2003.1214437","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2003.1214437","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.205.3166","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.205.3166","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.nyu.edu/~khot/papers/vc_hard.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1971749164","https://openalex.org/W1986296546","https://openalex.org/W2001663593","https://openalex.org/W2004012902","https://openalex.org/W2028146521","https://openalex.org/W2081254453","https://openalex.org/W2087226760","https://openalex.org/W2100856114","https://openalex.org/W2111385661","https://openalex.org/W2120358419","https://openalex.org/W2141815340","https://openalex.org/W2146823188","https://openalex.org/W2160033075","https://openalex.org/W2166366531","https://openalex.org/W2173464082","https://openalex.org/W6634338772"],"related_works":["https://openalex.org/W1566660502","https://openalex.org/W2156896570","https://openalex.org/W4232403550","https://openalex.org/W623607250","https://openalex.org/W2036594069","https://openalex.org/W4245429118","https://openalex.org/W41549461","https://openalex.org/W4205110281","https://openalex.org/W4212927854","https://openalex.org/W4211151614"],"abstract_inverted_index":{"Based":[0],"on":[1,40,46],"a":[2,35],"conjecture":[3],"regarding":[4],"the":[5,41],"power":[6],"of":[7],"unique":[8],"2-prover-1-round":[9],"games":[10],"presented":[11],"in":[12],"[S.":[13],"Khot,":[14],"(2002)],":[15],"we":[16],"show":[17,34],"that":[18],"vertex":[19,44],"cover":[20,45],"is":[21,49],"hard":[22,50],"to":[23,51],"approximate":[24,52],"within":[25,53],"any":[26,54],"constant":[27,55],"factor":[28,56],"better":[29,57],"than":[30,58],"2.":[31],"We":[32],"actually":[33],"stronger":[36],"result,":[37],"namely,":[38],"based":[39],"same":[42],"conjecture,":[43],"k-uniform":[47],"hypergraphs":[48],"k.":[59]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":7}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}