3 citations · 3 across the 1 of their papers we have counts for
1 paper
Benjamin Doerr, Amirhossein Rajabi, Carsten Witt
We prove that Simulated Annealing with an appropriate cooling schedule computes arbitrarily tight constant-factor approximations to the minimum spanning tree problem in polynomial…