{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T19:46:21Z","timestamp":1776282381005,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":18,"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.1276964","type":"proceedings-article","created":{"date-parts":[[2007,12,7]],"date-time":"2007-12-07T19:19:41Z","timestamp":1197055181000},"page":"33-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["On the runtime analysis of the 1-ANT ACO algorithm"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Sudholt","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Dortmund, Dortmund, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Dortmund, Dortmund, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11844297_99"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.05.020"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/975277"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_5_1","volume-title":"An Introduction to Probability Theory and Its Applications","author":"Feller W.","year":"1968","unstructured":"W. Feller . An Introduction to Probability Theory and Its Applications , volume 1 . Wiley , 3 rd edition, 1968 . W. Feller. An Introduction to Probability Theory and Its Applications, volume 1. Wiley, 3rd edition, 1968.","edition":"3"},{"key":"e_1_3_2_1_6_1","volume-title":"An Introduction to Probability Theory and Its Applications","author":"Feller W.","year":"1971","unstructured":"W. Feller . An Introduction to Probability Theory and Its Applications , volume 2 . Wiley , 2 nd edition, 1971 . W. Feller. An Introduction to Probability Theory and Its Applications, volume 2. Wiley, 2nd edition, 1971.","edition":"2"},{"key":"e_1_3_2_1_7_1","series-title":"LNCS","first-page":"415","volume-title":"Proc. of STACS '03","author":"Giel O.","year":"2003","unstructured":"O. Giel and I. Wegener . Evolutionary algorithms and the maximum matching problem . In Proc. of STACS '03 , volume 2607 of LNCS , pages 415 - 426 , 2003 . O. Giel and I. Wegener. Evolutionary algorithms and the maximum matching problem. In Proc. of STACS '03, volume 2607 of LNCS, pages 415-426, 2003."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269964803174086"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.12.017"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365602760234090"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_13_1","series-title":"LNCS","first-page":"713","volume-title":"Proc. of GECCO '04","author":"Neumann F.","year":"2004","unstructured":"F. Neumann and I. Wegener . Randomized local search, evolutionary algorithms, and the minimum spanning tree problem . In Proc. of GECCO '04 , volume 3102 of LNCS , pages 713 -- 724 , 2004 . F. Neumann and I. Wegener. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. In Proc. of GECCO '04, volume 3102 of LNCS, pages 713--724, 2004."},{"key":"e_1_3_2_1_14_1","volume-title":"Electronic Colloquium on Computational Complexity (ECCC)","author":"Neumann F.","year":"2006","unstructured":"F. Neumann and C. Witt . Ant Colony Optimization and the minimum spanning tree problem . In Electronic Colloquium on Computational Complexity (ECCC) , 2006 . Report No. 143. F. Neumann and C. Witt. Ant Colony Optimization and the minimum spanning tree problem. In Electronic Colloquium on Computational Complexity (ECCC), 2006. Report No. 143."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11940128_62"},{"key":"e_1_3_2_1_16_1","volume-title":"Verlag Dr. Kova\u010d","author":"Rudolph G.","year":"1997","unstructured":"G. Rudolph . Convergence Properties of Evolutionary Algorithms . Verlag Dr. Kova\u010d , 1997 . G. Rudolph. Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kova\u010d, 1997."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/348599.348603"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068202"},{"key":"e_1_3_2_1_19_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.1276964","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1276958.1276964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:04Z","timestamp":1750258684000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1276958.1276964"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,7]]},"references-count":18,"alternative-id":["10.1145\/1276958.1276964","10.1145\/1276958"],"URL":"https:\/\/doi.org\/10.1145\/1276958.1276964","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"}}]}}