{"id":"https://openalex.org/W2319388310","doi":"https://doi.org/10.1051/ro/2016018","title":"Dual parameterization and parameterized approximability of subset graph problems","display_name":"Dual parameterization and parameterized approximability of subset graph problems","publication_year":2016,"publication_date":"2016-02-19","ids":{"openalex":"https://openalex.org/W2319388310","doi":"https://doi.org/10.1051/ro/2016018","mag":"2319388310"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2016018","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2016018","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://www.numdam.org/item/10.1051/ro/2016018.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083806838","display_name":"\u00c9douard Bonnet","orcid":"https://orcid.org/0000-0002-1653-5822"},"institutions":[{"id":"https://openalex.org/I4210117195","display_name":"HUN-REN Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I4387152226"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"\u00c9douard Bonnet","raw_affiliation_strings":["Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), 1051 Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), 1051 Budapest, Hungary","institution_ids":["https://openalex.org/I4210117195"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111473903","display_name":"Vang\u00e9lis Th. Paschos","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Vangelis Th. Paschos","raw_affiliation_strings":["PSL* Research University, Universit\u00e9 Paris-Dauphine, LAMSADE, CNRS UMR 7243, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PSL* Research University, Universit\u00e9 Paris-Dauphine, LAMSADE, CNRS UMR 7243, Paris, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I56435720"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0351001,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"51","issue":"1","first_page":"261","last_page":"266"},"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.9993000030517578,"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.9868999719619751,"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.9016587138175964},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.8682495355606079},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.7602798938751221},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6902049779891968},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6799354553222656},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6050845980644226},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5734094381332397},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5307574272155762},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4712534248828888},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.46831852197647095},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.46147534251213074},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4567396342754364},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4312424063682556},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42721259593963623},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22963523864746094}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9016587138175964},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8682495355606079},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.7602798938751221},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6902049779891968},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6799354553222656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6050845980644226},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5734094381332397},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5307574272155762},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4712534248828888},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.46831852197647095},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.46147534251213074},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4567396342754364},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4312424063682556},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42721259593963623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22963523864746094},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1051/ro/2016018","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2016018","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:basepub.dauphine.psl.eu:123456789/25873","is_oa":true,"landing_page_url":"http://www.numdam.org/item/RO_2017__51_1_261_0/","pdf_url":"http://www.numdam.org/item/10.1051/ro/2016018.pdf","source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article accept\u00e9 pour publication ou publi\u00e9"},{"id":"pmh:oai:HAL:hal-03964617v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03964617","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":false,"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":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"RAIRO - Operations Research, 2017, 51 (1), pp.261-266. ⟨10.1051/ro/2016018⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:numdam.org:RO_2017__51_1_261_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ro/2016018/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:basepub.dauphine.psl.eu:123456789/25873","is_oa":true,"landing_page_url":"http://www.numdam.org/item/RO_2017__51_1_261_0/","pdf_url":"http://www.numdam.org/item/10.1051/ro/2016018.pdf","source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article accept\u00e9 pour publication ou publi\u00e9"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2319388310.pdf"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W92405270","https://openalex.org/W172361097","https://openalex.org/W1488421129","https://openalex.org/W1492330052","https://openalex.org/W1516574938","https://openalex.org/W1593916827","https://openalex.org/W1804016314","https://openalex.org/W1941111399","https://openalex.org/W1976422444","https://openalex.org/W1978782513","https://openalex.org/W1980809300","https://openalex.org/W1994262057","https://openalex.org/W2001258377","https://openalex.org/W2085218394","https://openalex.org/W2118980874","https://openalex.org/W2126186592","https://openalex.org/W2128049247","https://openalex.org/W2137560895","https://openalex.org/W2140874208","https://openalex.org/W2157124529","https://openalex.org/W2161286454","https://openalex.org/W2486715098","https://openalex.org/W2913688336","https://openalex.org/W4285719527","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2112112676","https://openalex.org/W2108073487","https://openalex.org/W2079730540","https://openalex.org/W2359923140","https://openalex.org/W1966805076","https://openalex.org/W2551034790","https://openalex.org/W2963350429","https://openalex.org/W4302317037","https://openalex.org/W4390589815","https://openalex.org/W2012700732"],"abstract_inverted_index":{"We":[0,50,78],"discuss":[1],"approximability":[2,52],"in":[3],"FPT-time":[4],"for":[5],"the":[6,22,26,59,70,75],"class":[7,30],"of":[8,21,25,53,69,85],"subset":[9,20],"optimization":[10],"graph":[11],"problems":[12,55],"where":[13,65],"a":[14,19],"feasible":[15],"solution":[16],"S":[17],"is":[18,67],"vertex":[23,41,48,71],"set":[24,72],"input":[27],"graph.":[28],"This":[29],"encompasses":[31],"many":[32,84],"well-known":[33],"problems,":[34,87],"such":[35,54,82],"as":[36],"min":[37,40,46],"dominating":[38],"set,":[39,45],"cover,":[42],"max":[43],"independent":[44],"feedback":[47],"set.":[49],"study":[51],"with":[56],"respect":[57],"to":[58],"dual":[60],"parameter":[61],"n":[62,66],"\u2212":[63],"k":[64,74],"size":[68],"and":[73],"standard":[76],"parameter.":[77],"show":[79],"that":[80],"under":[81],"parameterization,":[83],"these":[86],"while":[88],"W[\u00b7]-hard,":[89],"admit":[90],"parameterized":[91],"approximation":[92],"schemata.":[93]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}