On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results (Q1969944)
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: On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results |
scientific article; zbMATH DE number 1417532
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results |
scientific article; zbMATH DE number 1417532 |
Statements
On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results (English)
0 references
12 December 2000
0 references
The rectilinear Steiner tree problem asks for a shortest tree connecting \(n\) given points in the plane with rectilinear distance. The authors present a dynamic programming approach to this problem with worst-case time bound of \(O(n^2 \cdot 2.38^n)\), and for random instances they prove a running time of \(\alpha^n\) with constant \(\alpha<2\).
0 references
Rectilinear Steiner trees
0 references
algorithms
0 references
dynamic programming
0 references
