Steiner trees in general nonuniform orientations

Citation
Yy. Li et al., Steiner trees in general nonuniform orientations, COMPUTING, 66(1), 2001, pp. 41-78
Citations number
16
Categorie Soggetti
Computer Science & Engineering
Journal title
COMPUTING
ISSN journal
0010485X → ACNP
Volume
66
Issue
1
Year of publication
2001
Pages
41 - 78
Database
ISI
SICI code
0010-485X(2001)66:1<41:STIGNO>2.0.ZU;2-C
Abstract
In this paper we consider Steiner minimum trees (SMT) in the plane, where t he connections can only be along a given set of fixed but arbitrary (not ne cessarily uniform) orientations. The orientations define a metric, called t he general orientation metric. A(sigma), where sigma is the number of orien tations. We prove that in A(sigma) metric, there exists an SMT whose Steine r points belong to an (n - 2)-level grid. This result generalizes a result by Lee and Shen [11], and a result by Du and Hwang [5]. In the former case. the same result was obtained for the special case when all orientations ar e uniform, while in the latter case the same result was proven for the spec ial case when there are only three arbitrary orientations. We then modify t he proof used in the main result for the special case when sigma = 3. i.e,, only three arbitrary orientations are considered, and obtain a better resu lt, which states that there exists an SMT whose Steiner points belong to an inverted right perpendicular n-1/2 inverted left perpendicular -level grid . The result has also been obtained by Lin and Xue [9] using a different ap proach.