Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem

Location
Deutsche Nationalbibliothek Frankfurt am Main
Extent
Online-Ressource, 1 online resource.
Language
Englisch

Bibliographic citation
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem ; day:22 ; month:7 ; year:2023 ; pages:1-26
Algorithmica ; (22.7.2023), 1-26

Creator
Doerr, Benjamin
Rajabi, Amirhossein
Witt, Carsten
Contributor
SpringerLink (Online service)

DOI
10.1007/s00453-023-01135-x
URN
urn:nbn:de:101:1-2023102609374089833245
Rights
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
14.08.2025, 11:01 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Associated

  • Doerr, Benjamin
  • Rajabi, Amirhossein
  • Witt, Carsten
  • SpringerLink (Online service)

Other Objects (12)