{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:19Z","timestamp":1760203039898,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T00:00:00Z","timestamp":1657238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Independent Research Fund Denmark","award":["8021-00260B"],"award-info":[{"award-number":["8021-00260B"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,8]]},"DOI":"10.1145\/3512290.3528812","type":"proceedings-article","created":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T20:02:57Z","timestamp":1657310577000},"page":"1381-1389","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amirhossein","family":"Rajabi","sequence":"additional","affiliation":[{"name":"Technical University of Denmark, Kgs. Lyngby, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[{"name":"Technical University of Denmark, Kgs. Lyngby, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2019.03.001"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.09.032"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9585-3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9622-x"},{"key":"e_1_3_2_1_5_1","volume-title":"Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. CoRR 2204.02097","author":"Doerr Benjamin","year":"2022","unstructured":"Benjamin Doerr, Amirhossein Rajabi, and Carsten Witt. 2022. Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. CoRR 2204.02097 (2022), 19. https:\/\/arxiv.org\/abs\/2204.02097"},{"key":"e_1_3_2_1_6_1","volume-title":"Foundations of Genetic Algorithms, FOGA","author":"Droste Stefan","year":"2000","unstructured":"Stefan Droste, Thomas Jansen, and Ingo Wegener. 2000. Dynamic parameter control in simple evolutionary algorithms. In Foundations of Genetic Algorithms, FOGA 2000. Morgan Kaufmann, 275--294."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.12.015"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36494-3_37"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00014"},{"volume-title":"Theory of Randomized Search Heuristics","author":"Jansen Thomas","key":"e_1_3_2_1_10_1","unstructured":"Thomas Jansen. 2011. Simulated annealing. In Theory of Randomized Search Heuristics, Anne Auger and Benjamin Doerr (Eds.). World Scientific Publishing, 171--195."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.06.003"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00133-9"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548320000565"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012322"},{"key":"e_1_3_2_1_16_1","volume-title":"Sutton","author":"Neumann Frank","year":"2020","unstructured":"Frank Neumann and Andrew M. Sutton. 2020. Parameterized complexity analysis of randomized search heuristics. In Theory of Evolutionary Computation - Recent Developments in Discrete Optimization, Benjamin Doerr and Frank Neumann (Eds.). Springer, 213--248."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.002"},{"volume-title":"Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity","author":"Neumann Frank","key":"e_1_3_2_1_18_1","unstructured":"Frank Neumann and Carsten Witt. 2010. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0369-2"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.46160"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/234"},{"key":"e_1_3_2_1_22_1","volume-title":"Automata","author":"Wegener Ingo","year":"2005","unstructured":"Ingo Wegener. 2005. Simulated annealing beats Metropolis in combinatorial optimization. In Automata, Languages and Programming, ICALP 2005. Springer, 589--601."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_4"}],"event":{"name":"GECCO '22: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Boston Massachusetts","acronym":"GECCO '22"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512290.3528812","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3512290.3528812","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:56Z","timestamp":1750183796000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512290.3528812"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,8]]},"references-count":23,"alternative-id":["10.1145\/3512290.3528812","10.1145\/3512290"],"URL":"https:\/\/doi.org\/10.1145\/3512290.3528812","relation":{},"subject":[],"published":{"date-parts":[[2022,7,8]]},"assertion":[{"value":"2022-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}