Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem (Q6185935)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem |
scientific article; zbMATH DE number 7785275
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem |
scientific article; zbMATH DE number 7785275 |
Statements
Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem (English)
0 references
9 January 2024
0 references
simulated annealing
0 references
approximation scheme
0 references
minimum spanning trees
0 references
runtime analysis
0 references
theory
0 references
0 references
0 references
0 references
0 references
0 references
0 references
