{"id":"https://openalex.org/W3165049892","doi":"https://doi.org/10.1007/978-3-030-75242-2_14","title":"Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation","display_name":"Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3165049892","doi":"https://doi.org/10.1007/978-3-030-75242-2_14","mag":"3165049892"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-75242-2_14","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"book series"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"book-chapter","type_crossref":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2101.07550","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085931301","display_name":"Louis Dublois","orcid":null},"institutions":[{"id":"https://openalex.org/I4210137929","display_name":"Lamsade","ror":"https://ror.org/03pnp1a74","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I4210137929","https://openalex.org/I4210159245","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Louis Dublois","raw_affiliation_strings":["Laboratoire d'analyse et mod\u00e9lisation de syst\u00e8mes pour l'aide \u00e0 la d\u00e9cision"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'analyse et mod\u00e9lisation de syst\u00e8mes pour l'aide \u00e0 la d\u00e9cision","institution_ids":["https://openalex.org/I4210137929"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059698872","display_name":"Michael Lampis","orcid":"https://orcid.org/0000-0002-5791-0887"},"institutions":[{"id":"https://openalex.org/I4210137929","display_name":"Lamsade","ror":"https://ror.org/03pnp1a74","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I4210137929","https://openalex.org/I4210159245","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Michael Lampis","raw_affiliation_strings":["Laboratoire d'analyse et mod\u00e9lisation de syst\u00e8mes pour l'aide \u00e0 la d\u00e9cision"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'analyse et mod\u00e9lisation de syst\u00e8mes pour l'aide \u00e0 la d\u00e9cision","institution_ids":["https://openalex.org/I4210137929"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111473903","display_name":"Vang\u00e9lis Th. Paschos","orcid":null},"institutions":[{"id":"https://openalex.org/I4210137929","display_name":"Lamsade","ror":"https://ror.org/03pnp1a74","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I4210137929","https://openalex.org/I4210159245","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Vangelis Th. Paschos","raw_affiliation_strings":["Laboratoire d'analyse et mod\u00e9lisation de syst\u00e8mes pour l'aide \u00e0 la d\u00e9cision"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'analyse et mod\u00e9lisation de syst\u00e8mes pour l'aide \u00e0 la d\u00e9cision","institution_ids":["https://openalex.org/I4210137929"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392,"provenance":"doaj"},"apc_paid":null,"fwci":2.107,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":3,"citation_normalized_percentile":{"value":0.822028,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":73,"max":77},"biblio":{"volume":null,"issue":null,"first_page":"202","last_page":"215"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Graph Theory and Algorithms","score":0.9997,"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":"Graph Theory and Algorithms","score":0.9997,"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":"Combinatorial Optimization and Complexity Theory","score":0.9995,"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/T10829","display_name":"Networks on Chip in System-on-Chip Design","score":0.9784,"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/dominating-set","display_name":"Dominating set","score":0.72080684},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.60037005},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.58136624},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized Complexity","score":0.551648},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"Approximation Algorithms","score":0.547808},{"id":"https://openalex.org/keywords/constraint-satisfaction-problems","display_name":"Constraint Satisfaction Problems","score":0.5296},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5101405},{"id":"https://openalex.org/keywords/power-optimization","display_name":"Power Optimization","score":0.505199},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph Algorithms","score":0.504575}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.77102304},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7318613},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.72080684},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7006588},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6685741},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.60037005},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.58136624},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5664828},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5101405},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.50681645},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.47387955},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4489462},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.41025987},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37229526},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3418172},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.17717227},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09764108},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09590441},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.06533256},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-75242-2_14","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"book series"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":false,"landing_page_url":"https://hal.science/hal-03964524","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":["Centre National de la Recherche Scientifique"],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2101.07550","pdf_url":"https://arxiv.org/pdf/2101.07550","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2101.07550","pdf_url":"https://arxiv.org/pdf/2101.07550","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":26,"referenced_works":["https://openalex.org/W1493071618","https://openalex.org/W149515359","https://openalex.org/W1548167816","https://openalex.org/W1661438368","https://openalex.org/W1976422444","https://openalex.org/W2014221091","https://openalex.org/W2053372822","https://openalex.org/W2092239832","https://openalex.org/W2130190334","https://openalex.org/W2151423246","https://openalex.org/W2174900396","https://openalex.org/W2400752627","https://openalex.org/W2580171847","https://openalex.org/W2597500097","https://openalex.org/W2625060274","https://openalex.org/W2798803126","https://openalex.org/W2800485060","https://openalex.org/W2914414140","https://openalex.org/W2951496695","https://openalex.org/W2963196712","https://openalex.org/W2964301480","https://openalex.org/W2976984178","https://openalex.org/W2981213845","https://openalex.org/W2997214368","https://openalex.org/W3089108840","https://openalex.org/W3098987631"],"related_works":["https://openalex.org/W4299290985","https://openalex.org/W4287804545","https://openalex.org/W3172736027","https://openalex.org/W3102280101","https://openalex.org/W2953073202","https://openalex.org/W2800485060","https://openalex.org/W2087638517","https://openalex.org/W2007607373","https://openalex.org/W1917327560","https://openalex.org/W1787126581"],"abstract_inverted_index":{"An":[0],"upper":[1,24],"dominating":[2,7,25],"set":[3,8,26],"is":[4,20,90,129,173],"a":[5,10,122,141],"minimal":[6],"in":[9,60,67,95,113,155,181,206,219],"graph.":[11],"In":[12],"the":[13,18,32,68,74,102,117,130,136,182,186,214,217],"Upper":[14,38],"Dominating":[15,39,55],"Set":[16,56],"problem,":[17],"goal":[19],"to":[21,176],"find":[22],"an":[23,110,149,153,177,204],"of":[27,34,216],"maximum":[28],"size.":[29],"We":[30,166],"study":[31],"complexity":[33,76,104],"parameterized":[35,105],"algorithms":[36],"for":[37,79,146,158,190],"Set,":[40],"as":[41,43],"well":[42],"its":[44],"sub-exponential":[45,143,220],"approximation.":[46],"First,":[47],"we":[48,71,100,132,139,211],"prove":[49],"that,":[50],"under":[51,73,135,185],"ETH,":[52,188],"k":[53],"-Upper":[54],"cannot":[57],"be":[58],"solved":[59],"time":[61,70,96,114,156,207],"\\(O(n^{o(k)})\\)":[62],"(improving":[63,116],"on":[64],"\\(O(n^{o(\\sqrt{k})})\\)),":[65],"and":[66,84,121,189,196],"same":[69,75],"show":[72,168],"assumption":[77],"that":[78,126,151,169],"any":[80,85,159,191],"constant":[81,180],"ratio":[82,162,192],"r":[83],"\\(\\varepsilon":[86,197],">":[87,194,198],"0\\),":[88,199],"there":[89],"no":[91,200],"r-approximation":[92,154,205],"algorithm":[93,111,128,145,150,201],"running":[94,112],"\\(O(n^{k^{1-\\varepsilon":[97],"}})\\).":[98],"Then,":[99],"settle":[101],"problem\u2019s":[103],"by":[106,108],"pathwidth":[107],"giving":[109],"\\(O^*(6^{pw})\\)":[115],"current":[118],"best":[119,131],"\\(O^*(7^{pw})\\)),":[120],"lower":[123],"bound":[124],"showing":[125],"our":[127],"can":[133,202],"get":[134],"SETH.":[137],"Furthermore,":[138],"obtain":[140],"simple":[142],"approximation":[144,161],"this":[147,170],"problem:":[148],"produces":[152],"\\(n^{O(n/r)}\\),":[157],"desired":[160],"\\(r":[163,193],"<":[164],"n\\).":[165],"finally":[167],"time-approximation":[171],"trade-off":[172],"tight,":[174],"up":[175],"arbitrarily":[178],"small":[179],"second":[183],"exponent:":[184],"randomized":[187],"1\\)":[195],"output":[203],"\\(n^{(n/r)^{1-\\varepsilon":[208],"}}\\).":[209],"Hence,":[210],"completely":[212],"characterize":[213],"approximability":[215],"problem":[218],"time.":[221]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3165049892","counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2024-10-18T10:27:48.530420","created_date":"2021-06-07"}
