{"id":"https://openalex.org/W2295669206","doi":"https://doi.org/10.1145/2840728.2840733","title":"On Hardness of Approximating the Parameterized Clique Problem","display_name":"On Hardness of Approximating the Parameterized Clique Problem","publication_year":2016,"publication_date":"2016-01-05","ids":{"openalex":"https://openalex.org/W2295669206","doi":"https://doi.org/10.1145/2840728.2840733","mag":"2295669206"},"language":"en","primary_location":{"id":"doi:10.1145/2840728.2840733","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2840728.2840733","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2840728.2840733","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2840728.2840733","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067917669","display_name":"Subhash Khot","orcid":"https://orcid.org/0009-0007-9246-4011"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Subhash Khot","raw_affiliation_strings":["NYU, New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NYU, New York, NY, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028165107","display_name":"Igor Shinkar","orcid":"https://orcid.org/0000-0001-5013-6422"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Igor Shinkar","raw_affiliation_strings":["NYU, New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NYU, New York, NY, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"37","last_page":"45"},"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.9997000098228455,"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.9979000091552734,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.9306246042251587},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7721511721611023},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6696224808692932},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.615497350692749},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.5794684886932373},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.5496382713317871},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5403857827186584},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.5023953914642334},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4861447513103485},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48493698239326477},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4255019426345825},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4200449585914612},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.18890395760536194},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15764904022216797}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9306246042251587},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7721511721611023},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6696224808692932},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.615497350692749},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.5794684886932373},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.5496382713317871},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5403857827186584},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.5023953914642334},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4861447513103485},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48493698239326477},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4255019426345825},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4200449585914612},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.18890395760536194},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15764904022216797},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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":1,"locations":[{"id":"doi:10.1145/2840728.2840733","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2840728.2840733","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2840728.2840733","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/2840728.2840733","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2840728.2840733","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2840728.2840733","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3706869708","display_name":null,"funder_award_id":"1422159, 1061938, 0832795","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2295669206.pdf","grobid_xml":"https://content.openalex.org/works/W2295669206.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W156757921","https://openalex.org/W1492330052","https://openalex.org/W1519147138","https://openalex.org/W1562183207","https://openalex.org/W1570425181","https://openalex.org/W1967870799","https://openalex.org/W1980809300","https://openalex.org/W2019578639","https://openalex.org/W2022841964","https://openalex.org/W2059658171","https://openalex.org/W2061513598","https://openalex.org/W2082647621","https://openalex.org/W2086653003","https://openalex.org/W2110504689","https://openalex.org/W2141815340","https://openalex.org/W2148352980","https://openalex.org/W2293988196","https://openalex.org/W2913688336","https://openalex.org/W3004537778","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2803460775","https://openalex.org/W2043610021","https://openalex.org/W4399522433","https://openalex.org/W2165678151","https://openalex.org/W4300880616","https://openalex.org/W2950687698","https://openalex.org/W2082603400","https://openalex.org/W1796509207","https://openalex.org/W4200634309","https://openalex.org/W2295669206"],"abstract_inverted_index":{"In":[0],"the":[1,6,14,40,47,76,80],"Gap-clique":[2,48],"(k,":[3,49],"k/2)":[4,50],"problem,":[5],"input":[7],"is":[8,16,35,52,71,83],"an":[9,36,60,72],"n-vertex":[10],"graph":[11],"G,":[12],"and":[13,79],"goal":[15],"to":[17],"decide":[18],"whether":[19,46,57],"G":[20],"contains":[21,28],"a":[22,84],"clique":[23,30],"of":[24,31,42,75,87],"size":[25,32],"k":[26,78],"or":[27],"no":[29],"k/2.":[33],"It":[34],"open":[37],"question":[38],"in":[39,64],"study":[41],"fixed":[43,53],"parameterized":[44],"tractability":[45],"problem":[51],"parameter":[54,77],"tractable,":[55],"i.e.,":[56],"it":[58],"has":[59],"algorithm":[61],"that":[62],"runs":[63],"time":[65],"f(k)":[66,70],"\u22c5":[67],"n\u03b1,":[68],"where":[69],"arbitrary":[73],"function":[74],"exponent":[81],"\u03b1":[82],"constant":[85],"independent":[86],"k.":[88]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}