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.
Original language | English |
---|---|
Journal | Information Processing Letters |
Pages (from-to) | 237-241 |
ISSN | 0020-0190 |
Publication status | Published - 2002 |
Externally published | Yes |
Keywords
- Computational geometry
- Interconnection networks
- Steiner trees