{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:42Z","timestamp":1750219782362,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:00:00Z","timestamp":1689379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ministry of Science Technological Development and Innovations of the Republic of Serbia","award":["451-03- 47\/2023-01\/200104"],"award-info":[{"award-number":["451-03- 47\/2023-01\/200104"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,15]]},"DOI":"10.1145\/3583133.3590607","type":"proceedings-article","created":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T23:30:33Z","timestamp":1690241433000},"page":"239-242","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Variable neighborhood search for solving the k-domination problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-6881-0196","authenticated-orcid":false,"given":"Milan","family":"Predojevi\u0107","sequence":"first","affiliation":[{"name":"University of Banja Luka, Banja Luka, Bosnia and Herzegovina"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9839-6039","authenticated-orcid":false,"given":"Aleksandar","family":"Kartelj","sequence":"additional","affiliation":[{"name":"University of Belgrade, Belgrade, Serbia &amp; Montenegro"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1358-3789","authenticated-orcid":false,"given":"Marko","family":"Djukanovi\u0107","sequence":"additional","affiliation":[{"name":"University of Banja Luka, Banja Luka, Bosnia and Herzegovina"}]}],"member":"320","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"volume-title":"Recent developments in cooperative control and optimization","author":"Butenko Sergiy","key":"e_1_3_2_2_1_1","unstructured":"Sergiy Butenko , Xiuzhen Cheng , Carlos A Oliveira , and Panos M Pardalos . 2004. A new heuristic for the minimum connected dominating set problem on ad hoc wireless networks . In Recent developments in cooperative control and optimization . Springer , 61--73. Sergiy Butenko, Xiuzhen Cheng, Carlos A Oliveira, and Panos M Pardalos. 2004. A new heuristic for the minimum connected dominating set problem on ad hoc wireless networks. In Recent developments in cooperative control and optimization. Springer, 61--73."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.10.033"},{"key":"e_1_3_2_2_3_1","unstructured":"Gerard Jennhwa Chang. 1983. K-DOMINATION AND GRAPH COVERING PROBLEMS. (1983).  Gerard Jennhwa Chang. 1983. K-DOMINATION AND GRAPH COVERING PROBLEMS. (1983)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105368"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11945529_15"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00884-6"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.03.014"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.07.004"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2005.03.002"},{"volume-title":"Fundamentals of domination in graphs","author":"Haynes Teresa W","key":"e_1_3_2_2_10_1","unstructured":"Teresa W Haynes , Stephen Hedetniemi , and Peter Slater . 2013. Fundamentals of domination in graphs . CRC press . Teresa W Haynes, Stephen Hedetniemi, and Peter Slater. 2013. Fundamentals of domination in graphs. CRC press."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12189-0_40"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-011-0043-y"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.04.033"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1080\/08839510600940132"},{"key":"e_1_3_2_2_15_1","first-page":"62","article-title":"New algorithms for minimum dominating set in any graphs","volume":"5","author":"C\u0130 Ali","year":"2020","unstructured":"Ali KAR C\u0130 . 2020 . New algorithms for minimum dominating set in any graphs . Computer Science 5 , 2 (2020), 62 -- 70 . Ali KARC\u0130. 2020. New algorithms for minimum dominating set in any graphs. Computer Science 5, 2 (2020), 62--70.","journal-title":"Computer Science"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.01.015"},{"key":"e_1_3_2_2_17_1","volume-title":"Variable neighborhood search. Computers & operations research 24, 11","author":"Mladenovi\u0107 Nenad","year":"1997","unstructured":"Nenad Mladenovi\u0107 and Pierre Hansen . 1997. Variable neighborhood search. Computers & operations research 24, 11 ( 1997 ), 1097--1100. Nenad Mladenovi\u0107 and Pierre Hansen. 1997. Variable neighborhood search. Computers & operations research 24, 11 (1997), 1097--1100."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ymeth.2015.12.017"},{"key":"e_1_3_2_2_19_1","volume-title":"Analysis of a greedy heuristic for finding small dominating sets in graphs. Information processing letters 39, 5","author":"Parekh Abhay K","year":"1991","unstructured":"Abhay K Parekh . 1991. Analysis of a greedy heuristic for finding small dominating sets in graphs. Information processing letters 39, 5 ( 1991 ), 237--240. Abhay K Parekh. 1991. Analysis of a greedy heuristic for finding small dominating sets in graphs. Information processing letters 39, 5 (1991), 237--240."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.03.001"},{"key":"e_1_3_2_2_21_1","volume-title":"Proceedings of the 12th WSEAS international conference on automatic control, modelling and simulation","author":"Romania QATAR SERBIA","year":"2010","unstructured":"QATAR SERBIA Romania . 2010 . Ant colony optimization applied to minimum weight dominating set problem . In Proceedings of the 12th WSEAS international conference on automatic control, modelling and simulation . Catania, Italy. 29--31. QATAR SERBIA Romania. 2010. Ant colony optimization applied to minimum weight dominating set problem. In Proceedings of the 12th WSEAS international conference on automatic control, modelling and simulation. Catania, Italy. 29--31."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873781.1873892"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.07.001"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-53917-6_11"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.3390\/math7030222"}],"event":{"name":"GECCO '23 Companion: Companion Conference on Genetic and Evolutionary Computation","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lisbon Portugal","acronym":"GECCO '23 Companion"},"container-title":["Proceedings of the Companion Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3590607","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583133.3590607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:45Z","timestamp":1750178265000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3590607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,15]]},"references-count":25,"alternative-id":["10.1145\/3583133.3590607","10.1145\/3583133"],"URL":"https:\/\/doi.org\/10.1145\/3583133.3590607","relation":{},"subject":[],"published":{"date-parts":[[2023,7,15]]},"assertion":[{"value":"2023-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}