On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
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\).
scientific article; zbMATH DE number 1417532