{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:07:46Z","timestamp":1743120466785,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031265037"},{"type":"electronic","value":"9783031265044"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-26504-4_47","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"554-559","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Fast Metaheuristic for\u00a0Finding the\u00a0Minimum Dominating Set in\u00a0Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3417-6859","authenticated-orcid":false,"given":"Alejandra","family":"Casado","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4838-3170","authenticated-orcid":false,"given":"Sergio","family":"Bermudo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3022-3865","authenticated-orcid":false,"given":"Ana Dolores","family":"L\u00f3pez-S\u00e1nchez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1702-4941","authenticated-orcid":false,"given":"Jes\u00fas","family":"S\u00e1nchez-Oro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"key":"47_CR1","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."},{"key":"47_CR2","unstructured":"De Jaenisch, C.F.: Applications de l\u2019Analuse mathematique an Jen des Echecs. Petrograd (1862)"},{"key":"47_CR3","first-page":"89","volume":"42","author":"D Erwin","year":"2004","unstructured":"Erwin, D.: Dominating broadcasts in graphs. Int. J. Comput. Eng. Technol. 42, 89\u2013105 (2004)","journal-title":"Int. J. Comput. Eng. Technol."},{"issue":"2","key":"47_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo, T.A., Resende, M.G.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8(2), 67\u201371 (1989)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"47_CR5","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1137\/S0895480100375831","volume":"15","author":"TW Haynes","year":"2002","unstructured":"Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Henning, M.A.: Domination in graphs applied to electric power networks. SIAM J. Discret. Math. 15(4), 519\u2013529 (2002)","journal-title":"SIAM J. Discret. Math."},{"key":"47_CR6","doi-asserted-by":"publisher","DOI":"10.1201\/9781482246582","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"2013","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. CRC Press, Boca Raton (2013)"},{"key":"47_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58892-2","volume-title":"Structures of Domination in Graphs","author":"TW Haynes","year":"2021","unstructured":"Haynes, T.W., Hedetniemi, S.T., Henning, M.A.: Structures of Domination in Graphs. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-58892-2"},{"key":"47_CR8","unstructured":"Haynes, T.: Domination in Graphs: Volume 2: Advanced Topics. Routledge (2017)"},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"Lozano-Osorio, I., S\u00e1nchez-Oro, J., Duarte, A., Cord\u00f3n, \u00d3.: A quick grasp-based method for influence maximization in social networks. J. Ambient Intell. Human. Comput. 1\u201313 (2021)","DOI":"10.1007\/s12652-021-03510-4"},{"key":"47_CR10","doi-asserted-by":"publisher","DOI":"10.1090\/coll\/038","volume-title":"Theory of Graphs","author":"O Ore","year":"1962","unstructured":"Ore, O.: Theory of Graphs. AMS, Providence (1962)"},{"key":"47_CR11","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.asoc.2012.07.009","volume":"13","author":"A Potluri","year":"2013","unstructured":"Potluri, A., Singh, A.: Hybrid metaheuristic algorithms for minimum weight dominating set. Appl. Soft Comput. 13, 76\u201388 (2013)","journal-title":"Appl. Soft Comput."}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26504-4_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:05:46Z","timestamp":1688198746000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ortigia-Syracuse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ants-lab.it\/mic2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}