Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem.

Benjamin Doerr Amirhossein Rajabi Carsten Witt

Published in: CoRR (2022)

Keyphrases

polynomial time approximation
simulated annealing
approximation algorithms
error bounds
np hard
vertex cover
genetic algorithm
evolutionary algorithm
metaheuristic
simulated annealing algorithm
tabu search
bin packing
identical machines
special case
theoretical analysis
global optimum