{"id":"https://openalex.org/W3044099633","doi":"https://doi.org/10.1137/18m1166869","title":"From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More","display_name":"From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3044099633","doi":"https://doi.org/10.1137/18m1166869","mag":"3044099633"},"language":"en","primary_location":{"id":"doi:10.1137/18m1166869","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1166869","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":true,"oa_status":"green","oa_url":"https://research.aalto.fi/en/publications/09f74f78-f800-4d42-9a12-c56d0dbd47c6","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016828567","display_name":"Parinya Chalermsook","orcid":"https://orcid.org/0009-0000-2833-0472"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Parinya Chalermsook","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037989463","display_name":"Marek Cygan","orcid":"https://orcid.org/0000-0003-2472-2975"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marek Cygan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056370891","display_name":"Guy Kortsarz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guy Kortsarz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005632876","display_name":"Bundit Laekhanukit","orcid":"https://orcid.org/0000-0002-4476-8914"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Bundit Laekhanukit","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":"https://orcid.org/0000-0002-4476-8914","affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001520779","display_name":"Pasin Manurangsi","orcid":"https://orcid.org/0000-0002-1052-2801"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pasin Manurangsi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074369690","display_name":"Danupon Nanongkai","orcid":"https://orcid.org/0000-0003-4468-2675"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Danupon Nanongkai","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-4468-2675","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5057752375","display_name":"Luca Trevisan","orcid":"https://orcid.org/0000-0002-6982-8530"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luca Trevisan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7596,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.77616267,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"49","issue":"4","first_page":"772","last_page":"810"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9883000254631042,"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/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.8069860935211182},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.7819371223449707},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7787395715713501},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6626431941986084},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6570196151733398},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6347885131835938},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5209468603134155},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4898211658000946},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4777718782424927},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4730077087879181},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4694727659225464},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4635538160800934},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4347835183143616},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29612523317337036},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1094520092010498}],"concepts":[{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.8069860935211182},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.7819371223449707},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7787395715713501},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6626431941986084},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6570196151733398},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6347885131835938},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5209468603134155},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4898211658000946},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4777718782424927},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4730077087879181},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4694727659225464},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4635538160800934},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4347835183143616},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29612523317337036},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1094520092010498},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/18m1166869","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1166869","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"},{"id":"pmh:oai:aaltodoc.aalto.fi:123456789/46935","is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/09f74f78-f800-4d42-9a12-c56d0dbd47c6","pdf_url":null,"source":{"id":"https://openalex.org/S4306401663","display_name":"Aaltodoc (Aalto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9927081","host_organization_name":"Aalto University","host_organization_lineage":["https://openalex.org/I9927081"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.mpg.de:item_3255855","is_oa":false,"landing_page_url":"http://hdl.handle.net/21.11116/0000-0007-1D05-4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:aaltodoc.aalto.fi:123456789/46935","is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/09f74f78-f800-4d42-9a12-c56d0dbd47c6","pdf_url":null,"source":{"id":"https://openalex.org/S4306401663","display_name":"Aaltodoc (Aalto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9927081","host_organization_name":"Aalto University","host_organization_lineage":["https://openalex.org/I9927081"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.41999998688697815}],"awards":[{"id":"https://openalex.org/G1049157113","display_name":null,"funder_award_id":"CCF 1655215","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1981933775","display_name":null,"funder_award_id":"2015-04659","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G3440488298","display_name":"AF: Small: RUI: Network design and facility location problems","funder_award_id":"1218620","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4304470407","display_name":null,"funder_award_id":"621/12","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G4512687146","display_name":null,"funder_award_id":"CCF 1740425","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7346351820","display_name":null,"funder_award_id":"CCF 1540685","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8093936802","display_name":"BSF:2014163:Approximability of network design problems","funder_award_id":"1540547","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8162387565","display_name":null,"funder_award_id":"No 677651","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G895032013","display_name":"Distributed and Dynamic Graph Algorithms and Complexity","funder_award_id":"715672","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"},{"id":"https://openalex.org/F4320335016","display_name":"Israeli Centers for Research Excellence","ror":"https://ror.org/03w2v9593"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1444168583","https://openalex.org/W1586797185","https://openalex.org/W1970259241","https://openalex.org/W1980809300","https://openalex.org/W1985572324","https://openalex.org/W1994118705","https://openalex.org/W1995725694","https://openalex.org/W1999032440","https://openalex.org/W2004181701","https://openalex.org/W2013821228","https://openalex.org/W2015698277","https://openalex.org/W2017052164","https://openalex.org/W2019578639","https://openalex.org/W2022749269","https://openalex.org/W2029910715","https://openalex.org/W2030965968","https://openalex.org/W2036836182","https://openalex.org/W2038691311","https://openalex.org/W2041837101","https://openalex.org/W2053651631","https://openalex.org/W2059453880","https://openalex.org/W2064561122","https://openalex.org/W2068155033","https://openalex.org/W2074465184","https://openalex.org/W2077451547","https://openalex.org/W2086653003","https://openalex.org/W2091602684","https://openalex.org/W2095912437","https://openalex.org/W2108967854","https://openalex.org/W2111385661","https://openalex.org/W2130190334","https://openalex.org/W2143996311","https://openalex.org/W2148352980","https://openalex.org/W2157054705","https://openalex.org/W2610183793","https://openalex.org/W4205550388","https://openalex.org/W4210377846"],"related_works":["https://openalex.org/W4399522433","https://openalex.org/W4200634309","https://openalex.org/W2803460775","https://openalex.org/W1034070228","https://openalex.org/W4389156785","https://openalex.org/W2492498253","https://openalex.org/W4298060463","https://openalex.org/W3172736027","https://openalex.org/W3102280101","https://openalex.org/W4287804545"],"abstract_inverted_index":{"We":[0],"consider":[1],"questions":[2],"that":[3,79,100,117,201],"arise":[4],"from":[5],"the":[6,9,39,53,56,65,70,73,181,242,246,271,275],"intersection":[7],"between":[8,207],"areas":[10],"of":[11,55,72,89,103,248],"polynomial-time":[12],"approximation":[13],"algorithms,":[14,16],"subexponential-time":[15],"and":[17,44,67,85,98,121,139,166,193,214,232,260,267],"fixed-parameter":[18],"tractable":[19],"(FPT)":[20],"algorithms.":[21],"The":[22,159],"questions,":[23],"which":[24,199,216],"have":[25],"been":[26],"asked":[27],"several":[28],"times,":[29],"are":[30,101],"whether":[31],"there":[32,76,130],"is":[33,75,131,171,217],"a":[34,87,208],"nontrivial":[35,126,239],"FPT-approximation":[36,127,240],"algorithm":[37,78,135,143,204,273],"for":[38,93,136,144,147,223,241,274],"Maximum":[40,243,256,261],"Clique":[41],"$({\\sf":[42,48],"Clique})$":[43],"Minimum":[45],"Dominating":[46],"Set":[47],"DomSet})$":[49],"problems":[50],"parameterized":[51],"by":[52],"size":[54,71,90],"optimal":[57],"solution.":[58],"In":[59,112,151],"particular,":[60],"letting":[61],"${\\sf":[62,106,119,122,137,145,164,167,230,233],"OPT}$":[63],"be":[64,69],"optimum":[66],"$N$":[68,104],"input,":[74],"an":[77],"runs":[80],"in":[81,264],"$t({\\sf":[82],"OPT}){\\operatorname{poly}}(N)$":[83],"time":[84],"outputs":[86],"solution":[88],"$f({\\sf":[91,110,141],"OPT})$":[92],"any":[94,148],"computable":[95],"functions":[96],"$t$":[97],"$f$":[99],"independent":[102],"(for":[105],"Clique}$,":[107],"we":[108,115,235,268],"want":[109],"OPT})=\\omega(1)$)?":[111],"this":[113],"paper,":[114],"show":[116],"both":[118],"Clique}$":[120,138,165,231],"DomSet}$":[123,146],"admit":[124],"no":[125,132,140,202],"algorithm,":[128],"i.e.,":[129],"$o({\\sf":[133],"OPT})$-FPT-approximation":[134,142],"function":[149],"$f$.":[150],"fact,":[152],"our":[153],"results":[154,178],"imply":[155],"something":[156],"even":[157,169,219],"stronger:":[158],"best":[160],"way":[161],"to":[162,172],"solve":[163],"DomSet}$,":[168,234],"approximately,":[170],"essentially":[173],"enumerate":[174],"all":[175],"possibilities.":[176],"Our":[177],"hold":[179],"under":[180],"Gap":[182],"Exponential":[183],"Time":[184],"Hypothesis":[185],"[I.":[186],"Dinur.":[187],"ECCC,":[188],"TR16-128,":[189],"2016;":[190],"P.":[191,194],"Manurangsi":[192],"Raghavendra,":[195],"preprint,":[196],"arXiv:1607.02986,":[197],"2016],":[198],"states":[200],"$2^{o(n)}$-time":[203],"can":[205],"distinguish":[206],"satisfiable":[209],"3":[210],"\\sf":[211],"SAT":[212],"formula":[213],"one":[215],"not":[218],"$(1":[220],"-":[221],"\\varepsilon)$-satisfiable":[222],"some":[224],"constant":[225],"$\\varepsilon":[226],">":[227],"0$.":[228],"Besides":[229],"also":[236],"rule":[237,269],"out":[238,270],"Biclique":[244],"problem,":[245],"problem":[247],"finding":[249],"maximum":[250],"subgraphs":[251],"with":[252],"hereditary":[253],"properties":[254],"(e.g.,":[255],"Induced":[257,262],"Planar":[258],"Subgraph),":[259],"Matching":[263],"bipartite":[265],"graphs,":[266],"$k^{o(1)}$-FPT-approximation":[272],"Densest":[276],"$k$-Subgraph":[277],"problem.":[278]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-17T09:13:05.818461","created_date":"2025-10-10T00:00:00"}