{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:54:57Z","timestamp":1743076497327,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031477645"},{"type":"electronic","value":"9783031477652"}],"license":[{"start":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T00:00:00Z","timestamp":1699488000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T00:00:00Z","timestamp":1699488000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-47765-2_20","type":"book-chapter","created":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T15:03:04Z","timestamp":1699455784000},"page":"271-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Applying Genetic Algorithms to Validate a Conjecture in Graph Theory: The Minimum Dominating Set Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2267-7165","authenticated-orcid":false,"given":"Jorge","family":"Cervantes-Ojeda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0033-4476","authenticated-orcid":false,"given":"Mar\u00eda C.","family":"G\u00f3mez-Fuentes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9834-8157","authenticated-orcid":false,"given":"Julian A.","family":"Fres\u00e1n-Figueroa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,9]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Cervantes, J., Stephens, C.R.: Rank based variation operators for genetic algorithms. In: Proceedings of the 10th annual conference on Genetic and evolutionary computation, pp. 905\u2013912, ACM (2008)","DOI":"10.1145\/1389095.1389271"},{"key":"20_CR2","doi-asserted-by":"publisher","unstructured":"Hedar, A.R., Ismail, R.: Hybrid genetic algorithm for minimum dominating set problem. In: Taniar, D., Gervasi, O., Murgante, B., Pardede, E., Apduhan, B.O. (eds.) International conference on computational science and its applications, vol. 6019, pp. 457\u2013467. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12189-0_40","DOI":"10.1007\/978-3-642-12189-0_40"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Couturier, J.F., Heggernes, P., Van\u2019t Hof, P., Kratsch, D.: Minimal dominating sets in graph classes: combinatorial bounds and enumeration. Theoret. Comput. Sci. 487, 82\u201394 (2013)","DOI":"10.1016\/j.tcs.2013.03.026"},{"issue":"6","key":"20_CR4","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.3923\/itj.2010.1081.1092","volume":"9","author":"Z Liu","year":"2010","unstructured":"Liu, Z., Wang, B., Guo, L.: A survey on connected dominating set construction algorithm for. Inf. Technol. J. 9(6), 1081\u20131092 (2010)","journal-title":"Inf. Technol. J."},{"key":"20_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2019.102023","volume":"97","author":"X Bai","year":"2020","unstructured":"Bai, X., Zhao, D., Bai, S., Wang, Q., Li, W., Mu, D.: Minimum connected dominating sets in heterogeneous 3D wireless ad hoc networks. Ad Hoc Netw. 97, 102023 (2020)","journal-title":"Ad Hoc Netw."},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.3390\/a14030079","volume":"14","author":"S Bouamama","year":"2021","unstructured":"Bouamama, S., Blum, C.: An improved greedy heuristic for the minimum positive influence dominating set problem in social networks. Algorithms 14(3), 79 (2021)","journal-title":"Algorithms"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ins.2017.10.033","volume":"426","author":"D Chalupa","year":"2018","unstructured":"Chalupa, D.: An order-based algorithm for minimum dominating set with application in graph mining. Inf. Sci. 426, 101\u2013116 (2018)","journal-title":"Inf. Sci."},{"issue":"3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10878-012-9530-7","volume":"27","author":"TN Dinh","year":"2014","unstructured":"Dinh, T.N., Shen, Y., Nguyen, D.T., Thai, M.T.: On the approximability of positive influence dominating set in social networks. J. Comb. Optim. 27(3), 487\u2013503 (2014)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"S8","DOI":"10.1134\/S1064226921130040","volume":"66","author":"MS Levin","year":"2021","unstructured":"Levin, M.S.: Note on dominating set problems. J. Commun. Technol. Electron. 66(1), S8\u2013S22 (2021). https:\/\/doi.org\/10.1134\/S1064226921130040","journal-title":"J. Commun. Technol. Electron."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Li, B., Zhang, X., Cai, S., Lin, J., Wang, Y., Blum, C.: NuCDS: an efficient local search algorithm for minimum connected dominating set. In: Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence, pp. 1503\u20131510 (2021, January)","DOI":"10.24963\/ijcai.2020\/209"},{"issue":"11","key":"20_CR11","doi-asserted-by":"publisher","first-page":"1858","DOI":"10.3390\/math8111858","volume":"8","author":"P Pinacho-Davidson","year":"2020","unstructured":"Pinacho-Davidson, P., Blum, C.: BARRAKUDA: A hybrid evolutionary algorithm for minimum capacitated dominating set problem. Mathematics 8(11), 1858 (2020)","journal-title":"Mathematics"},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1435375.1435384","volume":"5","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Grandoni, F., Pyatkin, A.V., Stepanov, A.A.: Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications. ACM Trans. Algorithms (TALG) 5(1), 1\u201317 (2008)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"20_CR13","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"Introduction to Genetic Algorithms","author":"M Mitchell","year":"1996","unstructured":"Mitchell, M.: Introduction to Genetic Algorithms. MIT Press (1996)"},{"key":"20_CR14","unstructured":"De Jong K.A., Spears W.M.: Using genetic algorithms to solve NP-complete problems. In: International Computer Games Association, pp. 124\u2013132 (1989)"},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0377-2217(94)00166-9","volume":"88","author":"S Jakobs","year":"1996","unstructured":"Jakobs, S.: On genetic algorithms for the packing of polygons. Eur. J. Oper. Res. 88(1), 165\u2013181 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"24","key":"20_CR16","first-page":"11483","volume":"219","author":"A Pourrajabian","year":"2013","unstructured":"Pourrajabian, A., Ebrahimi, R., Mirzaei, M., Shams, M.: Applying genetic algorithms for solving nonlinear algebraic equations. Appl. Math. Comput. 219(24), 11483\u201311494 (2013)","journal-title":"Appl. Math. Comput."},{"key":"20_CR17","doi-asserted-by":"publisher","unstructured":"Cervantes-Ojeda J., G\u00f3mez-Fuentes M.C., Gonz\u00e1lez-Moreno D., Olsen M.: Rainbow connectivity using a rank genetic algorithm. J. Appl. Math. 2019(7), (2019) https:\/\/doi.org\/10.1155\/2019\/4073905","DOI":"10.1155\/2019\/4073905"},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Garc\u00eda-Altamirano, J. C., Olsen, M., Cervantes-Ojeda, J.: How to construct the symmetric cycle of length 5 using Haj\u00f3s construction with an adapted Rank Genetic Algorithm. Discrete Math. Theor. Comput. Sci., 25(1), 1\u201311 (2023) https:\/\/doi.org\/10.46298\/dmtcs.10189","DOI":"10.46298\/dmtcs.10189"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Cervantes, J., Stephens., C. R.: Limitations of existing mutation rate heuristics and how a rank GA overcomes them. IEEE Trans. Evol. Comput. 13(2) 369\u2013397 (2008)","DOI":"10.1109\/TEVC.2008.927707"}],"container-title":["Lecture Notes in Computer Science","Advances in Computational Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47765-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T07:04:38Z","timestamp":1731999878000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47765-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,9]]},"ISBN":["9783031477645","9783031477652"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47765-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,11,9]]},"assertion":[{"value":"9 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yucat\u00e1n","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"micai2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.micai.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}