Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem.
Benjamin DoerrAmirhossein RajabiCarsten WittPublished in: GECCO (2022)
Keyphrases
- polynomial time approximation
- simulated annealing
- np hard
- approximation algorithms
- error bounds
- vertex cover
- simulated annealing algorithm
- tabu search
- identical machines
- genetic algorithm
- metaheuristic
- genetic algorithm ga
- linear programming
- combinatorial optimization
- hill climbing
- optimal solution
- orders of magnitude
- cost function
- branch and bound algorithm
- special case
- query processing
- evolutionary algorithm
- lower bound