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

Benny Kjær Nielsen, Pawel Winter, Martin Zachariasen

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)237-241
Number of pages5
JournalInformation Processing Letters
Volume83
Issue number5
DOIs
Publication statusPublished - 2002

Keywords

  • computational geometry
  • interconnection networks
  • Steiner trees

Fingerprint

Dive into the research topics of 'On the location of Steiner points in uniformly-oriented Steiner trees'. Together they form a unique fingerprint.

Cite this