%0 Journal Article %1 journals/algorithmica/DoerrRW24 %A Doerr, Benjamin %A Rajabi, Amirhossein %A Witt, Carsten %D 2024 %J Algorithmica %K dblp %N 1 %P 64-89 %T Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. %U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica86.html#DoerrRW24 %V 86

@article{journals/algorithmica/DoerrRW24, added-at = {2024-01-11T00:00:00.000+0100}, author = {Doerr, Benjamin and Rajabi, Amirhossein and Witt, Carsten}, biburl = {https://www.bibsonomy.org/bibtex/2b054688acb5e9abe4893689ca284597f/dblp}, ee = {https://doi.org/10.1007/s00453-023-01135-x}, interhash = {38d8ee694cc794e39d60fd9828e2bd95}, intrahash = {b054688acb5e9abe4893689ca284597f}, journal = {Algorithmica}, keywords = {dblp}, month = {January}, number = 1, pages = {64-89}, timestamp = {2024-04-08T18:20:34.000+0200}, title = {Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem.}, url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica86.html#DoerrRW24}, volume = 86, year = 2024 }