On the location of Steiner points in uniformly-oriented Steiner trees

Authors:
Benny K. Nielsen;Pawel Winter;Martin Zachariasen
Affiliations:
Department of Computer Science, University of Copenhagen, DK-2100 Copenhagen Ø, Denmark;Department of Computer Science, University of Copenhagen, DK-2100 Copenhagen Ø, Denmark;Department of Computer Science, University of Copenhagen, DK-2100 Copenhagen Ø, Denmark
Venue:
Information Processing Letters
Year:
2002

Citing 1
Cited 2

Minimum Networks in Uniform Orientation Metrics

SIAM Journal on Computing

An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Rotationally optimal spanning and Steiner trees in uniform orientation metrics

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.90

Visualization

Abstract

We give a fundamental result on the location of Steiner points for Steiner minimum trees in uniform orientation metrics. As a corollary we obtain a linear time algorithm for constructing a Steiner minimum tree for a given full topology when the number of uniform orientations is λ = 3m, m ≥ 1.