On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results (Q1969944): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s004539910005 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2066933505 / rank | |||
Normal rank |
Latest revision as of 21:17, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results |
scientific article |
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