{"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":1750306255853,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1145\/3071178.3071257","type":"proceedings-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T17:59:28Z","timestamp":1498845568000},"page":"235-242","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Approximating optimization problems using EAs on scale-free networks"],"prefix":"10.1145","author":[{"given":"Ankit","family":"Chauhan","sequence":"first","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Quinzan","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"8","article-title":"A social network caught in the web","author":"Adamic L.","year":"2003","unstructured":"L. Adamic , O. Buyukkokten , and E. Adar . A social network caught in the web . First Monday , 8 , 2003 . L. Adamic, O. Buyukkokten, and E. Adar. A social network caught in the web. First Monday, 8, 2003.","journal-title":"First Monday"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1994.350004"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884526"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071257"},{"key":"e_1_3_2_1_5_1","first-page":"1","volume-title":"Proc. of 36th FSTTCS","author":"Chauhan A.","year":"2016","unstructured":"A. Chauhan , T. Friedrich , and R. Rothenberger . Greed is good for deterministic scale-free networks . In Proc. of 36th FSTTCS , pages 33: 1 -- 33 :15, 2016 . A. Chauhan, T. Friedrich, and R. Rothenberger. Greed is good for deterministic scale-free networks. In Proc. of 36th FSTTCS, pages 33:1--33:15, 2016."},{"key":"e_1_3_2_1_6_1","volume-title":"One Size Fits All : Effectiveness of Local Search on Structured Data. ArXiv e-prints, 1701.08423","author":"Cohen-Addad V.","year":"2017","unstructured":"V. Cohen-Addad and C. Schwiegelshohn . One Size Fits All : Effectiveness of Local Search on Structured Data. ArXiv e-prints, 1701.08423 , 2017 . V. Cohen-Addad and C. Schwiegelshohn. One Size Fits All : Effectiveness of Local Search on Structured Data. ArXiv e-prints, 1701.08423, 2017."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316229"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277118"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/646517.694055"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009201"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.974841"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795286612"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00040-7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2291790"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"issue":"1620","key":"e_1_3_2_1_18_1","first-page":"1629","article-title":"Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem","volume":"181","author":"Neumann F.","year":"2007","unstructured":"F. Neumann . Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem . European Journal of Operational Research , 181 : 1620 -- 1629 , 2007 . F. Neumann. Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem. European Journal of Operational Research, 181:1620 -- 1629, 2007.","journal-title":"European Journal of Operational Research"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.002"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424701"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2008.4631000"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27051-7_38"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470749722"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.08.013"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"Williamson D. P.","year":"2011","unstructured":"D. P. Williamson and D. B. Shmoys . The Design of Approximation Algorithms . Cambridge University Press , New York, NY, USA , 1 st edition, 2011 . D. P. Williamson and D. B. Shmoys. The Design of Approximation Algorithms. Cambridge University Press, New York, NY, USA, 1st edition, 2011.","edition":"1"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_4"}],"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.3071257","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3071178.3071257","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.3071257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":28,"alternative-id":["10.1145\/3071178.3071257","10.1145\/3071178"],"URL":"https:\/\/doi.org\/10.1145\/3071178.3071257","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"}}]}}