{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:34:18Z","timestamp":1774370058512,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T00:00:00Z","timestamp":1183766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,7,7]]},"DOI":"10.1145\/1276958.1277118","type":"proceedings-article","created":{"date-parts":[[2007,12,7]],"date-time":"2007-12-07T19:19:41Z","timestamp":1197055181000},"page":"797-804","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["Approximating covering problems by randomized search heuristics using multi-objective models"],"prefix":"10.1145","author":[{"given":"Tobias","family":"Friedrich","sequence":"first","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nils","family":"Hebbinghaus","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"He","sequence":"additional","affiliation":[{"name":"University of Birmingham"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[{"name":"University of Dortmund"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . MIT Press , 2. edition, 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2. edition, 2001."},{"key":"e_1_3_2_1_2_1","volume-title":"Graph Theory","author":"Diestel R.","year":"2005","unstructured":"R. Diestel . Graph Theory . Springer , 3 rd edition, 2005 . R. Diestel. Graph Theory. Springer, 3rd edition, 2005.","edition":"3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. of CEC 2003","author":"Giel O.","year":"1918","unstructured":"O. Giel . Expected runtimes of a simple multi-objective evolutionary algorithm . In Proc. of CEC 2003 , IEEE Press, pages 1918 --1925, 2003. O. Giel. Expected runtimes of a simple multi-objective evolutionary algorithm. In Proc. of CEC 2003, IEEE Press, pages 1918--1925, 2003."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/646517.694055"},{"key":"e_1_3_2_1_6_1","volume-title":"Evolutionary algorithms and the vertex cover problem (in German). Department of Computer Science","author":"Glaser O.","year":"2005","unstructured":"O. Glaser . Evolutionary algorithms and the vertex cover problem (in German). Department of Computer Science , University of Kiel , 2005 . O. Glaser. Evolutionary algorithms and the vertex cover problem (in German). Department of Computer Science, University of Kiel, 2005."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2004.841903"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.974841"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.823470"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30217-9_9"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24854-5_73"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-006-9004-x"},{"key":"e_1_3_2_1_14_1","volume-title":"Appromixation Algorithms","author":"Vazirani V.","year":"2001","unstructured":"V. Vazirani . Appromixation Algorithms . Springer , 2001 . V. Vazirani. Appromixation Algorithms. Springer, 2001."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_4"}],"event":{"name":"GECCO07: Genetic and Evolutionary Computation Conference","location":"London England","acronym":"GECCO07","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 9th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1276958.1277118","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1276958.1277118","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:30Z","timestamp":1750258350000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1276958.1277118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,7]]},"references-count":15,"alternative-id":["10.1145\/1276958.1277118","10.1145\/1276958"],"URL":"https:\/\/doi.org\/10.1145\/1276958.1277118","relation":{},"subject":[],"published":{"date-parts":[[2007,7,7]]},"assertion":[{"value":"2007-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}