{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:55:20Z","timestamp":1774418120420,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T00:00:00Z","timestamp":1562976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,13]]},"DOI":"10.1145\/3321707.3321807","type":"proceedings-article","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T13:48:04Z","timestamp":1562161684000},"page":"321-328","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Application of CMSA to the minimum capacitated dominating set problem"],"prefix":"10.1145","author":[{"given":"Pedro","family":"Pinacho-Davidson","sequence":"first","affiliation":[{"name":"Universidad de Concepci\u00f3n, Concepci\u00f3n, Chile"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salim","family":"Bouamama","sequence":"additional","affiliation":[{"name":"University of Ferhat Abbas, S\u00e9tif, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Blum","sequence":"additional","affiliation":[{"name":"Artificial Intelligence Research Institute (IIIA-CSIC), Bellaterra, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Christian Blum. 2016. Construct Merge Solve and Adapt: Application to unbalanced minimum common string partition. In Proceedings of HM 2016 - 10th International Workshop on Hybrid Metaheuristics (Lecture Notes in Computer Science) Maria J. Blesa Christian Blum Angelo Cangelosi Vincenzo Cutello Alessandro Di Nuovo Mario Pavone and El-Ghazali Talbi (Eds.) Vol. 9668. Springer International Publishing 17--31.  Christian Blum. 2016. Construct Merge Solve and Adapt: Application to unbalanced minimum common string partition. In Proceedings of HM 2016 - 10th International Workshop on Hybrid Metaheuristics (Lecture Notes in Computer Science) Maria J. Blesa Christian Blum Angelo Cangelosi Vincenzo Cutello Alessandro Di Nuovo Mario Pavone and El-Ghazali Talbi (Eds.) Vol. 9668. Springer International Publishing 17--31.","DOI":"10.1007\/978-3-319-39636-1_2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2873828.2874036"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13731-0_8"},{"key":"e_1_3_2_1_4_1","volume-title":"Johnson","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S . Johnson . 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. , New York, NY, USA. Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9271-x"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.11.015"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1057\/s41274-017-0268-6"},{"key":"e_1_3_2_1_8_1","volume-title":"Graph Theoretic Concepts in Computer Science, Dimitrios M","author":"Liedloff Mathieu","unstructured":"Mathieu Liedloff , Ioan Todinca , and Yngve Villanger . 2010. Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching . In Graph Theoretic Concepts in Computer Science, Dimitrios M . Thilikos (Ed.). Lecture Notes in Computer Science, Vol. 6410 . Springer-Verlag , Berlin, Heidelberg, 88--99. Mathieu Liedloff, Ioan Todinca, and Yngve Villanger. 2010. Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. In Graph Theoretic Concepts in Computer Science, Dimitrios M. Thilikos (Ed.). Lecture Notes in Computer Science, Vol. 6410. Springer-Verlag, Berlin, Heidelberg, 88--99."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"e_1_3_2_1_10_1","unstructured":"Michele Mastrogiovanni. 2007. The Clustering Simulation Framework: A Simple Manual. http:\/\/www.michele-matrogiovanni.net\/software\/download\/README.pdf. {Online; accessed 2017}.  Michele Mastrogiovanni. 2007. The Clustering Simulation Framework: A Simple Manual. http:\/\/www.michele-matrogiovanni.net\/software\/download\/README.pdf. {Online; accessed 2017}."},{"key":"e_1_3_2_1_11_1","volume-title":"Algorithms for Sensor and Ad Hoc Networks: Advanced Lectures","author":"Moscibroda Thomas","unstructured":"Thomas Moscibroda . 2007. Clustering . In Algorithms for Sensor and Ad Hoc Networks: Advanced Lectures , Dorothea Wagner and Roger Wattenhofer (Eds.). Springer-Verlag , Berlin, Heidelberg , 37--61. Thomas Moscibroda. 2007. Clustering. In Algorithms for Sensor and Ad Hoc Networks: Advanced Lectures, Dorothea Wagner and Roger Wattenhofer (Eds.). Springer-Verlag, Berlin, Heidelberg, 37--61."},{"key":"e_1_3_2_1_12_1","unstructured":"Jose Antonio Ortega-Toro Javier Ferrer and Francisco Chicano. 2018. CMSA para el problema de la generaci\u00f3n de casos de prueba priorizados en l\u00edneas de productos software. In Jornadas de Ingenier\u00eda del Software y Bases de Datos. Sociedad de Ingenier\u00eda de Software y Tecnolog\u00edas de Desarrollo de Software (SISTEDES). http:\/\/hdl.handle.net\/11705\/JISBD\/2018\/091  Jose Antonio Ortega-Toro Javier Ferrer and Francisco Chicano. 2018. CMSA para el problema de la generaci\u00f3n de casos de prueba priorizados en l\u00edneas de productos software. In Jornadas de Ingenier\u00eda del Software y Bases de Datos. Sociedad de Ingenier\u00eda de Software y Tecnolog\u00edas de Desarrollo de Software (SISTEDES). http:\/\/hdl.handle.net\/11705\/JISBD\/2018\/091"},{"key":"e_1_3_2_1_13_1","volume-title":"Contemporary Computing, Manish et al Parashar (Ed.). Communications in Computer and Information Science","author":"Potluri Anupama","unstructured":"Anupama Potluri and Alok Singh . 2012. A Greedy Heuristic and Its Variants for Minimum Capacitated Dominating Set . In Contemporary Computing, Manish et al Parashar (Ed.). Communications in Computer and Information Science , Vol. 306 . Springer-Verlag , Berlin, Heidelberg , 28--39. Anupama Potluri and Alok Singh. 2012. A Greedy Heuristic and Its Variants for Minimum Capacitated Dominating Set. In Contemporary Computing, Manish et al Parashar (Ed.). Communications in Computer and Information Science, Vol. 306. Springer-Verlag, Berlin, Heidelberg, 28--39."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2013.06.002"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/564585.564602"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000039523.95673.33"},{"key":"e_1_3_2_1_17_1","volume-title":"Ernst","author":"Thiruvady Dhananjay","year":"2019","unstructured":"Dhananjay Thiruvady , Christian Blum , and Andreas T . Ernst . 2019 . Maximising the Net Present Value of Project Schedules Using CMSA and Parallel ACO. In Proceedings of HM 2019 - 11th International Workshop on Hybrid Metaheuristics (Lecture Notes in Computer Science), Maria J. Blesa, Christian Blum, Haroldo Gambini Santos, Pedro Pinacho-Davidson, and Julio Godoy del Campo (Eds.), Vol. 11299 . Springer , 16--30. Dhananjay Thiruvady, Christian Blum, and Andreas T. Ernst. 2019. Maximising the Net Present Value of Project Schedules Using CMSA and Parallel ACO. In Proceedings of HM 2019 - 11th International Workshop on Hybrid Metaheuristics (Lecture Notes in Computer Science), Maria J. Blesa, Christian Blum, Haroldo Gambini Santos, Pedro Pinacho-Davidson, and Julio Godoy del Campo (Eds.), Vol. 11299. Springer, 16--30."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2005.1423333"}],"event":{"name":"GECCO '19: Genetic and Evolutionary Computation Conference","location":"Prague Czech Republic","acronym":"GECCO '19","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321807","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3321707.3321807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:28Z","timestamp":1750206328000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,13]]},"references-count":18,"alternative-id":["10.1145\/3321707.3321807","10.1145\/3321707"],"URL":"https:\/\/doi.org\/10.1145\/3321707.3321807","relation":{},"subject":[],"published":{"date-parts":[[2019,7,13]]},"assertion":[{"value":"2019-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}