Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem.
Benjamin DoerrAmirhossein RajabiCarsten WittPublished in: Algorithmica (2024)
Keyphrases
- polynomial time approximation
- simulated annealing
- np hard
- approximation algorithms
- error bounds
- vertex cover
- evolutionary algorithm
- metaheuristic
- identical machines
- global optimum
- tabu search
- genetic algorithm
- model selection
- upper bound
- query processing
- hill climbing
- bin packing
- approximation guarantees
- training set
- search algorithm
- learning algorithm