Benjamin Doerr, Amirhossein Rajabi, Carsten Witt. Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem. In Jonathan E. Fieldsend, Markus Wagner 0007, editors, GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9 - 13, 2022. pages 1381-1389, ACM, 2022. [doi]
@inproceedings{DoerrRW22,
title = {Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem},
author = {Benjamin Doerr and Amirhossein Rajabi and Carsten Witt},
year = {2022},
doi = {10.1145/3512290.3528812},
url = {https://doi.org/10.1145/3512290.3528812},
researchr = {https://researchr.org/publication/DoerrRW22},
cites = {0},
citedby = {0},
pages = {1381-1389},
booktitle = {GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9 - 13, 2022},
editor = {Jonathan E. Fieldsend and Markus Wagner 0007},
publisher = {ACM},
isbn = {978-1-4503-9237-2},
}