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. Algorithmica, 86(1):64-89, January 2024. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: