{"id":"https://openalex.org/W2963957639","doi":"https://doi.org/10.1145/3188745.3188896","title":"On the parameterized complexity of approximating dominating set","display_name":"On the parameterized complexity of approximating dominating set","publication_year":2018,"publication_date":"2018-06-20","ids":{"openalex":"https://openalex.org/W2963957639","doi":"https://doi.org/10.1145/3188745.3188896","mag":"2963957639"},"language":"en","primary_location":{"id":"doi:10.1145/3188745.3188896","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3188745.3188896","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"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/A5066903534","display_name":"C. S. Karthik","orcid":null},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Karthik C. S.","raw_affiliation_strings":["Weizmann Institute of Science, Israel"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"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/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I181679659","display_name":"Shanghai University of Finance and Economics","ror":"https://ror.org/00wtvfq62","country_code":"CN","type":"education","lineage":["https://openalex.org/I181679659"]}],"countries":["CN","DE"],"is_corresponding":false,"raw_author_name":"Bundit Laekhanukit","raw_affiliation_strings":["Max Planck Institute for Informatics, Germany / Shanghai University of Finance and Economics, China"],"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Germany / Shanghai University of Finance and Economics, China","institution_ids":["https://openalex.org/I181679659","https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001520779","display_name":"Pasin Manurangsi","orcid":"https://orcid.org/0000-0002-1052-2801"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pasin Manurangsi","raw_affiliation_strings":["University of California at Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066903534"],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":null,"apc_paid":null,"fwci":5.7699,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.96822961,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1283","last_page":"1296"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9983999729156494,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.9111748933792114},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.6551847457885742},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5794698596000671},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.571916937828064},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.522443950176239},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38505709171295166},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3459504544734955},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3228684663772583},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08643567562103271},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.0609472393989563}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9111748933792114},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.6551847457885742},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5794698596000671},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.571916937828064},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.522443950176239},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38505709171295166},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3459504544734955},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3228684663772583},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08643567562103271},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0609472393989563},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3188745.3188896","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3188745.3188896","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":71,"referenced_works":["https://openalex.org/W15998695","https://openalex.org/W1487579480","https://openalex.org/W1492330052","https://openalex.org/W1516574938","https://openalex.org/W1521238083","https://openalex.org/W1552693528","https://openalex.org/W1586797185","https://openalex.org/W1598441350","https://openalex.org/W1611546574","https://openalex.org/W1842876744","https://openalex.org/W1968633117","https://openalex.org/W1969665089","https://openalex.org/W1970259241","https://openalex.org/W1973113631","https://openalex.org/W1980223785","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W2003159902","https://openalex.org/W2003979824","https://openalex.org/W2007654329","https://openalex.org/W2012948111","https://openalex.org/W2019578639","https://openalex.org/W2029910715","https://openalex.org/W2030965968","https://openalex.org/W2038225707","https://openalex.org/W2038691311","https://openalex.org/W2040924621","https://openalex.org/W2044471216","https://openalex.org/W2059453880","https://openalex.org/W2061513598","https://openalex.org/W2070486524","https://openalex.org/W2073276518","https://openalex.org/W2079401865","https://openalex.org/W2084166252","https://openalex.org/W2084732238","https://openalex.org/W2098207812","https://openalex.org/W2107917944","https://openalex.org/W2116087731","https://openalex.org/W2119461694","https://openalex.org/W2126479983","https://openalex.org/W2130190334","https://openalex.org/W2143996311","https://openalex.org/W2148352980","https://openalex.org/W2150123893","https://openalex.org/W2157054705","https://openalex.org/W2157124529","https://openalex.org/W2163322487","https://openalex.org/W2164770202","https://openalex.org/W2340787257","https://openalex.org/W2401312511","https://openalex.org/W2401610261","https://openalex.org/W2408084357","https://openalex.org/W2461430093","https://openalex.org/W2547025167","https://openalex.org/W2557748541","https://openalex.org/W2576456765","https://openalex.org/W2775084241","https://openalex.org/W2787648812","https://openalex.org/W2794956177","https://openalex.org/W2912956481","https://openalex.org/W2963046172","https://openalex.org/W2963439929","https://openalex.org/W2963456765","https://openalex.org/W2963964051","https://openalex.org/W3137191742","https://openalex.org/W3137429815","https://openalex.org/W3183766709","https://openalex.org/W4213071546","https://openalex.org/W4285719527","https://openalex.org/W4297970684","https://openalex.org/W6642206136"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W136930666","https://openalex.org/W2951988738","https://openalex.org/W2525679459","https://openalex.org/W2171811389","https://openalex.org/W2041837101","https://openalex.org/W1598441350","https://openalex.org/W1539117866","https://openalex.org/W2914625303","https://openalex.org/W2053685668"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,7,28,44,87,98,118,140],"parameterized":[3],"complexity":[4],"of":[5,36,51,90,97,120],"approximating":[6],"k-Dominating":[8],"Set":[9],"(domset)":[10],"problem":[11],"where":[12],"an":[13,56,74,81,109,122],"integer":[14],"k":[15,42],"and":[16,27,92,126,148],"a":[17,33,48],"graph":[18,45],"G":[19,46],"on":[20],"n":[21],"vertices":[22],"are":[23],"given":[24],"as":[25,95],"input,":[26],"goal":[29],"is":[30,70,84],"to":[31,72,113],"find":[32],"dominating":[34,49],"set":[35,50],"size":[37,52],"at":[38],"most":[39],"F(k)":[40],"\u00b7":[41],"whenever":[43],"has":[47],"k.":[53],"When":[54],"such":[55,80,121],"algorithm":[57,76,82,123],"runs":[58],"in":[59,86,103],"time":[60,131],"T(k)poly(n)":[61],"(i.e.,":[62],"FPT-time)":[63],"for":[64,77,142],"some":[65],"computable":[66,144],"function":[67],"T,":[68,146],"it":[69],"said":[71],"be":[73],"F(k)-FPT-approximation":[75],"k-domset.":[78],"Whether":[79],"exists":[83],"listed":[85],"seminal":[88],"book":[89],"Downey":[91],"Fellows":[93],"(2013)":[94],"one":[96],"\u201dmost":[99],"infamous\u201d":[100],"open":[101],"problems":[102],"Parameterized":[104],"Complexity.":[105],"This":[106],"work":[107],"gives":[108],"almost":[110],"complete":[111],"answer":[112],"this":[114],"question":[115],"by":[116],"showing":[117],"non-existence":[119],"under":[124,134],"W[1]\u2260FPT":[125],"further":[127],"providing":[128],"tighter":[129],"running":[130],"lower":[132],"bounds":[133],"stronger":[135],"hypotheses.":[136],"Specifically,":[137],"we":[138],"prove":[139],"following":[141],"every":[143,149],"functions":[145],"F":[147],"constant":[150],"\u03b5":[151],">":[152],"0:":[153]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}