Rotationally optimal spanning and Steiner trees in uniform orientation metrics

DOI10.1016/j.comgeo.2004.04.001zbMath1051.05029OpenAlexW2079608245MaRDI QIDQ1886240

Martin Zachariasen, Pawel Winter, Benny K. Nielsen, Marcus Brazil

Publication date: 18 November 2004

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.04.001

zbMATH Keywords

VLSI designpolynomial-time algorithmSteiner treerotational problemsuniform orientation metrics

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Uses Software

• GeoSteiner

Cites Work

• Unnamed Item
• A linear time algorithm for full Steiner trees
• The Steiner tree problem
• The Steiner ratio
• On the location of Steiner points in uniformly-oriented Steiner trees.
• Canonical forms and algorithms for Steiner trees in uniform orientation metrics
• Minimum Networks in Uniform Orientation Metrics
• On Some Distance Problems in Fixed Orientations
• Euclidean Steiner minimum trees: An improved exact algorithm
• The local Steiner problem in normed planes

This page was built for publication: Rotationally optimal spanning and Steiner trees in uniform orientation metrics