{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:10:55Z","timestamp":1750306255761,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"State of Hessen","award":["473\/15-15"],"award-info":[{"award-number":["473\/15-15"]}]},{"name":"Spanish Ministry of Economy and Competitiveness (National Program for Research, Development and Innovation)","award":["TIN2015-65845-C3-3-R"],"award-info":[{"award-number":["TIN2015-65845-C3-3-R"]}]},{"name":"Excellence Network SEBASENet","award":["TIN2015-71841-REDT"],"award-info":[{"award-number":["TIN2015-71841-REDT"]}]},{"name":"European Union (European Regional Development Fund - ERDF)"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1145\/3071178.3071255","type":"proceedings-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T17:59:28Z","timestamp":1498845568000},"page":"1200-1207","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Optimization of monitoring in dynamic communication networks using a hybrid evolutionary algorithm"],"prefix":"10.1145","author":[{"given":"Robin","family":"Mueller-Bady","sequence":"first","affiliation":[{"name":"Frankfurt University of Applied Sciences, Frankfurt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kappes","sequence":"additional","affiliation":[{"name":"Frankfurt University of Applied Sciences, Frankfurt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inmaculada","family":"Medina-Bulo","sequence":"additional","affiliation":[{"name":"Universidad de C\u00e1diz, Puerto Real, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Palomo-Lozano","sequence":"additional","affiliation":[{"name":"Universidad de C\u00e1diz, Puerto Real, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1994.350004"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.02.013"},{"key":"e_1_3_2_1_3_1","volume-title":"IJCAI International Joint Conference on Artificial Intelligence 2015-Janua","author":"Cai Shaowei","year":"2015","unstructured":"Shaowei Cai . 2015 . Balance between complexity and quality: Local search for minimum vertex cover in massive graphs . IJCAI International Joint Conference on Artificial Intelligence 2015-Janua , Ijcai (2015), 747--753. Shaowei Cai. 2015. Balance between complexity and quality: Local search for minimum vertex cover in massive graphs. IJCAI International Joint Conference on Artificial Intelligence 2015-Janua, Ijcai (2015), 747--753."},{"key":"e_1_3_2_1_4_1","first-page":"1","article-title":"NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover","volume":"46","author":"Cai Shaowei","year":"2013","unstructured":"Shaowei Cai , Kaile Su , Chuan Luo , and Abdul Sattar . 2013 . NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover . J. Artif. Int. Res. 46 , 1 (jan 2013), 687--716. http:\/\/dl.acm.org\/citation.cfm?id=2512538.2512555 Shaowei Cai, Kaile Su, Chuan Luo, and Abdul Sattar. 2013. NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover. J. Artif. Int. Res. 46, 1 (jan 2013), 687--716. http:\/\/dl.acm.org\/citation.cfm?id=2512538.2512555","journal-title":"J. Artif. Int. Res."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7825(01)00323-1"},{"key":"e_1_3_2_1_6_1","volume-title":"Graph Theory","author":"Diestel Reinhard","unstructured":"Reinhard Diestel . 2010. Graph Theory ( 4 th editio ed.). Springer-Verlag , Heidelberg . 451 pages. http:\/\/diestel-graph-theory.com\/basic.html Reinhard Diestel. 2010. Graph Theory (4th editio ed.). Springer-Verlag, Heidelberg. 451 pages. http:\/\/diestel-graph-theory.com\/basic.html","edition":"4"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2005.162.439"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9622-x"},{"key":"e_1_3_2_1_9_1","volume-title":"Evolutionary Algorithms for Vertex Cover. In International Conference on Evolutionary Programming. Springer, 377--386","author":"Evans Isaac K.","year":"1998","unstructured":"Isaac K. Evans . 1998 . Evolutionary Algorithms for Vertex Cover. In International Conference on Evolutionary Programming. Springer, 377--386 . Isaac K. Evans. 1998. Evolutionary Algorithms for Vertex Cover. In International Conference on Evolutionary Programming. Springer, 377--386."},{"volume-title":"Genetic algorithms and engineering optimization","author":"Gen Mitsuo","key":"e_1_3_2_1_10_1","unstructured":"Mitsuo Gen and Runwei Cheng . 2000. Genetic algorithms and engineering optimization . Vol. 7 . 512 pages. Mitsuo Gen and Runwei Cheng. 2000. Genetic algorithms and engineering optimization. Vol. 7. 512 pages."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460239.2460248"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.05.023"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1597036.1597045"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Richard M. Karp. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations. 85--103.  Richard M. Karp. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations . 85--103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the KI-94 Workshop Genetic Algorithms within the Framework of Evolutionary Computation. 86--90","author":"Khuri Sami","year":"1994","unstructured":"Sami Khuri and Thomas B\u00e4ck . 1994 . An evolutionary heuristic for the minimum vertex cover problem . In Proceedings of the KI-94 Workshop Genetic Algorithms within the Framework of Evolutionary Computation. 86--90 . http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.40.4161 Sami Khuri and Thomas B\u00e4ck. 1994. An evolutionary heuristic for the minimum vertex cover problem. In Proceedings of the KI-94 Workshop Genetic Algorithms within the Framework of Evolutionary Computation. 86--90. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.40.4161"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2012.6375890"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1756039"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.10.001"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739482.2768430"},{"key":"e_1_3_2_1_21_1","volume-title":"Control and Computing (ICSTCC), 2016 20th International Conference on. DOI:http:\/\/dx.doi.org\/978-1-4799-2228-4\/13","author":"Mueller-Bady Robin","year":"2016","unstructured":"Robin Mueller-Bady , Martin Kappes , Inmaculada Medina-Bulo , and Francisco Palomo-Lozano . 2016 . Leveraging Diversity in Evolutionary Algorithms using a Population Injection Method. In System Theory , Control and Computing (ICSTCC), 2016 20th International Conference on. DOI:http:\/\/dx.doi.org\/978-1-4799-2228-4\/13 Robin Mueller-Bady, Martin Kappes, Inmaculada Medina-Bulo, and Francisco Palomo-Lozano. 2016. Leveraging Diversity in Evolutionary Algorithms using a Population Injection Method. In System Theory, Control and Computing (ICSTCC), 2016 20th International Conference on. DOI:http:\/\/dx.doi.org\/978-1-4799-2228-4\/13"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74565-5_31"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/4236.978369"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.2307\/3001968"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2005.12.016"}],"event":{"name":"GECCO '17: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Berlin Germany","acronym":"GECCO '17"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3071178.3071255","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3071178.3071255","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:05Z","timestamp":1750220645000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3071178.3071255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":25,"alternative-id":["10.1145\/3071178.3071255","10.1145\/3071178"],"URL":"https:\/\/doi.org\/10.1145\/3071178.3071255","relation":{},"subject":[],"published":{"date-parts":[[2017,7]]},"assertion":[{"value":"2017-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}