Lower bounds for rectilinear Steiner trees in bounded space
type: Item
instance of: scholarly article
title: Lower bounds for rectilinear Steiner trees in bounded space
zbMATH Open document ID: 0713.68098
DOI: 10.1016/0020-0190(91)90136-6
author: Timothy Law Snyder
published in: Information Processing Letters
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 4174385
zbMATH Keywords: lower bounds
zbMATH Keywords: computational geometry
zbMATH Keywords: combinatorial problems
zbMATH Keywords: worst-case
zbMATH Keywords: rectilinear Steiner tree
MaRDI profile type: Publication
full work available at URL: 0020-0190(91)90136-6
OpenAlex ID: W2484843909
cites work: Two probabilistic results on rectilinear Steiner trees
cites work: On Steiner trees for bounded point sets
cites work: The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter
cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete
cites work: Steiner Minimal Trees
cites work: On Steiner’s Problem with Rectilinear Distance
cites work: On Steiner Minimal Trees with Rectilinear Distance
cites work: On the Exact Location of Steiner Points in General Dimension
cites work: The Travelling Salesman Problem and Minimum Matching in the Unit Square
description: scientific article; zbMATH DE number 4174385