Lower bounds for rectilinear Steiner trees in bounded space

DOI10.1016/0020-0190(91)90136-6zbMATH Open0713.68098OpenAlexW2484843909MaRDI QIDQ750175FDOQ750175

Authors: Timothy Law Snyder 

Publication date: 1991

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90136-6

zbMATH Keywords

computational geometrylower boundscombinatorial problemsworst-caserectilinear Steiner tree

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Steiner Minimal Trees
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• On Steiner trees for bounded point sets
• The Travelling Salesman Problem and Minimum Matching in the Unit Square
• On Steiner Minimal Trees with Rectilinear Distance
• On Steiner’s Problem with Rectilinear Distance
• Two probabilistic results on rectilinear Steiner trees
• On the Exact Location of Steiner Points in General Dimension
• The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter

Cited In (6)

• Embedding rectilinear Steiner trees with length restrictions
• Worst-case minimum rectilinear Steiner trees in all dimensions
• A note on lower bounds for rectilinear Steiner trees
• A tight lower bound for planar Steiner orientation
• Minimum rectilinear Steiner tree of \(n\) points in the unit square
• Title not available (Why is that?)

This page was built for publication: Lower bounds for rectilinear Steiner trees in bounded space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750175)