"Simulated Annealing is a Polynomial-Time Approximation Scheme for the ..."

Benjamin Doerr, Amirhossein Rajabi, Carsten Witt (2024)

> Home

Details and statistics

DOI: 10.1007/S00453-023-01135-X

access: open

type: Journal Article

metadata version: 2024-06-08

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/DoerrRW24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/DoerrRW24
Benjamin Doerr, Amirhossein Rajabi, Carsten Witt:
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. Algorithmica 86(1): 64-89 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.