{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:47:58Z","timestamp":1765039678987,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031262807"},{"type":"electronic","value":"9783031262814"}],"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-26281-4_45","type":"book-chapter","created":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T06:47:02Z","timestamp":1676098022000},"page":"432-440","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Memetic Approach for Classic Minimum Dominating Set Problem"],"prefix":"10.1007","author":[{"given":"Peng","family":"Rui","sequence":"first","affiliation":[]},{"given":"Wu","family":"Xinyun","sequence":"additional","affiliation":[]},{"given":"Xiong","family":"Caiquan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,12]]},"reference":[{"key":"45_CR1","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/978-0-387-30165-5","volume-title":"Graph domination, coloring and cliques in telecommunications. In: Handbook of Optimization in Telecommunications","author":"B Balasundaram","year":"2006","unstructured":"Balasundaram, B., Butenko, S.: Graph domination, coloring and cliques in telecommunications. In: Handbook of Optimization in Telecommunications, pp. 865\u2013890. Springer, Boston, MA (2006). https:\/\/doi.org\/10.1007\/978-0-387-30165-5"},{"issue":"4","key":"45_CR2","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1109\/TMC.2012.42","volume":"12","author":"M Slavik","year":"2012","unstructured":"Slavik, M., Mahgoub, I.: Spatial distribution and channel quality adaptive protocol for multihop wireless broadcast routing in VANET. IEEE Trans. Mob. Comput. 12(4), 722\u2013734 (2012)","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"2","key":"45_CR3","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TMC.2004.10","volume":"3","author":"D Li","year":"2004","unstructured":"Li, D., Jia, X., Liu, H.: Energy efficient broadcast routing in static ad hoc wireless networks. IEEE Trans. Mob. Comput. 3(2), 144\u2013151 (2004)","journal-title":"IEEE Trans. Mob. Comput."},{"doi-asserted-by":"crossref","unstructured":"Approximation algorithms for NP-hard problems. ACM Sigact News 28(2), 40\u201352 (1997)","key":"45_CR4","DOI":"10.1145\/261342.571216"},{"issue":"1","key":"45_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0968-090X(94)00011-S","volume":"3","author":"MH Baaj","year":"1995","unstructured":"Baaj, M.H., Mahmassani, H.S.: Hybrid route generation heuristic algorithm for the design of transit networks. Transp. Res. Part C: Emerg. Technol. 3(1), 31\u201350 (1995)","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"issue":"2","key":"45_CR6","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00500-016-2474-6","volume":"22","author":"D Wang","year":"2018","unstructured":"Wang, D., Tan, D., Liu, L.: Particle swarm optimization algorithm: an overview. Soft. Comput. 22(2), 387\u2013408 (2018)","journal-title":"Soft. Comput."},{"issue":"2","key":"45_CR7","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1109\/59.867130","volume":"15","author":"RA Gallego","year":"2000","unstructured":"Gallego, R.A., Romero, R., Monticelli, A.J.: Tabu search algorithm for network synthesis. IEEE Trans. Power Syst. 15(2), 490\u2013495 (2000)","journal-title":"IEEE Trans. Power Syst."},{"issue":"4","key":"45_CR8","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo, M., Birattari, M., Stutzle, T.: Ant colony optimization. IEEE Comput. Intell. Mag. 1(4), 28\u201339 (2006)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"45_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-93025-1","volume-title":"Genetic algorithm. In: Evolutionary Algorithms and Neural Networks","author":"S Mirjalili","year":"2019","unstructured":"Mirjalili, S.: Genetic algorithm. In: Evolutionary Algorithms and Neural Networks, pp. 43\u201355. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-93025-1"},{"issue":"1\u20133","key":"45_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0166-218X(01)00362-6","volume":"121","author":"A Vince","year":"2002","unstructured":"Vince, A.: A framework for the greedy algorithm. Discret. Appl. Math. 121(1\u20133), 247\u2013260 (2002)","journal-title":"Discret. Appl. Math."},{"key":"45_CR11","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/j.asoc.2017.06.023","volume":"59","author":"ZA Dagdeviren","year":"2017","unstructured":"Dagdeviren, Z.A., Aydin, D., Cinsdikici, M.: Two population-based optimization algorithms for minimum weight connected dominating set problem. Appl. Soft Comput. 59, 644\u2013658 (2017)","journal-title":"Appl. Soft Comput."},{"issue":"11","key":"45_CR12","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"},{"doi-asserted-by":"publisher","unstructured":"Hedar, A.R., Ismail, R.: Hybrid genetic algorithm for minimum dominating set problem. In: International Conference on Computational Science and Its Applications. Springer, Berlin, Heidelberg, pp. 457\u2013467 (2010). https:\/\/doi.org\/10.1007\/978-3-642-12189-0_40","key":"45_CR13","DOI":"10.1007\/978-3-642-12189-0_40"}],"container-title":["Lecture Notes on Data Engineering and Communications Technologies","Advances in Internet, Data & Web Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26281-4_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T06:56:08Z","timestamp":1676098568000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26281-4_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031262807","9783031262814"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26281-4_45","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"type":"print","value":"2367-4512"},{"type":"electronic","value":"2367-4520"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"12 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EIDWT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Emerging Internetworking, Data & Web Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Semarang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","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":"23 February 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 February 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eidwt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/voyager.ce.fit.ac.jp\/conf\/eidwt\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}