{"id":"https://openalex.org/W2100009654","doi":"https://doi.org/10.1051/ro/2013034","title":"Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic","display_name":"Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic","publication_year":2013,"publication_date":"2013-05-02","ids":{"openalex":"https://openalex.org/W2100009654","doi":"https://doi.org/10.1051/ro/2013034","mag":"2100009654"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2013034","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2013034","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":"https://www.numdam.org/item/10.1051/ro/2013034.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087533174","display_name":"Christian Laforest","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/I198244214","display_name":"Universit\u00e9 Clermont Auvergne","ror":"https://ror.org/01a8ajp46","country_code":"FR","type":"education","lineage":["https://openalex.org/I198244214"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Christian Laforest","raw_affiliation_strings":["LIMOS, CNRS UMR 6158, Universit\u00e9 Blaise Pascal, Clermont\u2013Ferrand Campus des C\u00e9zeaux, 24 avenue des Landais, 63173 Aubi\u00e8re Cedex, France","LIMOS, CNRS UMR 6158, Universit\u00e9 Blaise Pascal, Clermont\u2013Ferrand Campus des\u00e9zeaux, 24 avenue des Landais, 63173 Aubi\u00e8re Cedex, France..  christian.laforest@isima.fr"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIMOS, CNRS UMR 6158, Universit\u00e9 Blaise Pascal, Clermont\u2013Ferrand Campus des C\u00e9zeaux, 24 avenue des Landais, 63173 Aubi\u00e8re Cedex, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I198244214"]},{"raw_affiliation_string":"LIMOS, CNRS UMR 6158, Universit\u00e9 Blaise Pascal, Clermont\u2013Ferrand Campus des\u00e9zeaux, 24 avenue des Landais, 63173 Aubi\u00e8re Cedex, France..  christian.laforest@isima.fr","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I198244214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055330596","display_name":"Raksmey Phan","orcid":"https://orcid.org/0000-0001-5586-586X"},"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/I198244214","display_name":"Universit\u00e9 Clermont Auvergne","ror":"https://ror.org/01a8ajp46","country_code":"FR","type":"education","lineage":["https://openalex.org/I198244214"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Raksmey Phan","raw_affiliation_strings":["LIMOS, CNRS UMR 6158, Universit\u00e9 Blaise Pascal, Clermont\u2013Ferrand Campus des C\u00e9zeaux, 24 avenue des Landais, 63173 Aubi\u00e8re Cedex, France","LIMOS, CNRS UMR 6158, Universit\u00e9 Blaise Pascal, Clermont\u2013Ferrand Campus des\u00e9zeaux, 24 avenue des Landais, 63173 Aubi\u00e8re Cedex, France..  christian.laforest@isima.fr"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIMOS, CNRS UMR 6158, Universit\u00e9 Blaise Pascal, Clermont\u2013Ferrand Campus des C\u00e9zeaux, 24 avenue des Landais, 63173 Aubi\u00e8re Cedex, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I198244214"]},{"raw_affiliation_string":"LIMOS, CNRS UMR 6158, Universit\u00e9 Blaise Pascal, Clermont\u2013Ferrand Campus des\u00e9zeaux, 24 avenue des Landais, 63173 Aubi\u00e8re Cedex, France..  christian.laforest@isima.fr","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I198244214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.426,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.82950896,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"47","issue":"3","first_page":"199","last_page":"221"},"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.9986000061035156,"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.9977999925613403,"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/partition","display_name":"Partition (number theory)","score":0.6165252923965454},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.583534836769104},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5603616833686829},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5505710244178772},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.49414923787117004},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4875161349773407},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4507068991661072},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4351770579814911},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41205042600631714},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4116847515106201},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3749701976776123},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3740636110305786},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35715800523757935},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3514712452888489},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.10963097214698792}],"concepts":[{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6165252923965454},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.583534836769104},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5603616833686829},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5505710244178772},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.49414923787117004},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4875161349773407},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4507068991661072},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4351770579814911},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41205042600631714},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4116847515106201},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3749701976776123},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3740636110305786},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35715800523757935},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3514712452888489},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.10963097214698792},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","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":2,"locations":[{"id":"doi:10.1051/ro/2013034","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2013034","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:numdam.org:RO_2013__47_3_199_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro/2013034/","pdf_url":"https://www.numdam.org/item/10.1051/ro/2013034.pdf","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:numdam.org:RO_2013__47_3_199_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro/2013034/","pdf_url":"https://www.numdam.org/item/10.1051/ro/2013034.pdf","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2705070221","display_name":null,"funder_award_id":"ANR-09-EMER","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G3316834430","display_name":null,"funder_award_id":"ANR-09-EMER-010","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2100009654.pdf","grobid_xml":"https://content.openalex.org/works/W2100009654.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1278605765","https://openalex.org/W1552692251","https://openalex.org/W1976422444","https://openalex.org/W1990831313","https://openalex.org/W2007940874","https://openalex.org/W2011039300","https://openalex.org/W2034417964","https://openalex.org/W2051902439","https://openalex.org/W2052569520","https://openalex.org/W2058196189","https://openalex.org/W2128326835","https://openalex.org/W2145337305","https://openalex.org/W2244532378","https://openalex.org/W2569523145","https://openalex.org/W3125684764","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W300018836","https://openalex.org/W2907170473","https://openalex.org/W3037291746","https://openalex.org/W3164644441","https://openalex.org/W2561239406","https://openalex.org/W1760432569","https://openalex.org/W2788922840","https://openalex.org/W3004945501","https://openalex.org/W2808807161","https://openalex.org/W2906881967"],"abstract_inverted_index":{"In":[0],"this":[1,75],"paper":[2,76],"we":[3,68,126],"present":[4],"a":[5,29,32,52,128,159],"new":[6],"approach":[7,161],"to":[8,97,103,113,122,145,162],"solve":[9,98],"the":[10,23,36,56,59,71,84],"Minimum":[11],"Independent":[12],"Dominating":[13],"Set":[14],"problem":[15],"in":[16,70,83,106,141,149],"general":[17],"graphs":[18],"which":[19,48],"is":[20,95,158],"one":[21],"of":[22,35,58,74,116,156,177],"hardest":[24],"optimization":[25],"problem.":[26],"We":[27,44,87,131,171],"propose":[28],"method":[30,50],"using":[31],"clique":[33],"partition":[34,38],"graph,":[37],"that":[39,93,133],"can":[40],"be":[41],"obtained":[42],"greedily.":[43],"provide":[45],"conditions":[46],"under":[47],"our":[49,65,168],"has":[51],"better":[53],"complexity":[54,57],"than":[55,151],"previously":[60],"known":[61],"algorithms.":[62],"Based":[63],"on":[64],"theoretical":[66],"method,":[67],"design":[69],"second":[72],"part":[73],"an":[77,164],"efficient":[78],"algorithm":[79],"by":[80],"including":[81],"cuts":[82],"search":[85],"process.":[86],"then":[88],"experiment":[89],"it":[90,94,134],"and":[91,109,121,174],"show":[92,132],"able":[96],"almost":[99],"all":[100],"instances":[101,111,143],"up":[102,112,144],"50":[104],"vertices":[105,148],"reasonable":[107],"time":[108],"some":[110,176],"several":[114],"hundreds":[115],"vertices.":[117],"To":[118],"go":[119],"further":[120],"treat":[123],"larger":[124],"graphs,":[125],"analyze":[127,175],"greedy":[129],"heuristic.":[130],"often":[135],"gives":[136],"good":[137,160],"(sometimes":[138],"optimal)":[139],"results":[140],"large":[142],"60":[146],"000":[147],"less":[150],"20":[152],"s.":[153],"That":[154],"sort":[155],"heuristic":[157],"get":[163],"initial":[165],"solution":[166],"for":[167],"exact":[169],"method.":[170],"also":[172],"describe":[173],"its":[178],"worst":[179],"cases.":[180]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}