On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
type: Item
instance of: scholarly article
title: On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
zbMATH Open document ID: 0951.68101
author: Michael Kaufmann
author: Ulrich Fößmeier
published in: Algorithmica
publication date: 2000-12-12T00:00:00Z
review text: 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\).
reviewed by: Klaus Dohmen
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1417532
zbMATH Keywords: Rectilinear Steiner trees
zbMATH Keywords: algorithms
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
full work available at URL: s004539910005
OpenAlex ID: W2066933505
DOI: 10.1007/S004539910005
description: scientific article; zbMATH DE number 1417532