Improved computation of plane Steiner minimal trees (Q1186797): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Denton E. Hewgill / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Alan C. Tucker / rank | |||
Normal rank | |||
Revision as of 07:13, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved computation of plane Steiner minimal trees |
scientific article |
Statements
Improved computation of plane Steiner minimal trees (English)
0 references
28 June 1992
0 references
A Steiner tree is the shortest network interconnecting a given set \(A\) of points in the Euclidean plane, with the introduction of additional points allowed. This paper examines recent technical results about Steiner trees that have allowed for considerable improvement in a computer program to determine the (exact) Steiner tree for randomly generated problems. While previously 30-point problems were effectively the largest sets that could be attacked, now 100-point problems can be solved.
0 references
computation
0 references
Steiner minimal trees
0 references
Steiner tree
0 references
Euclidean plane
0 references
