Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem

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]

Abstract

Abstract is missing.