✦ LIBER ✦

Flexibility of Steiner trees in uniform orientation metrics

✍ Scribed by M. Brazil; P. Winter; M. Zachariasen

Publisher: John Wiley and Sons
Year: 2005
Tongue: English
Weight: 272 KB
Volume: 46
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20082

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Steiner Tree Problem in Orientation

The Steiner Tree Problem in Orientation Metrics

✍ G.Y. Yan; A. Albrecht; G.H.F. Young; C.K. Wong 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Given a set 3 of : i (i=1, 2, ..., k) orientations (angles) in the plane, one can define a distance function which induces a metric in the plane, called the orientation metric [3]. In the special case where all the angles are equal, we call the metric a uniform orientation metric [2]. Specifically,

Forbidden subpaths for Steiner minimum n

Forbidden subpaths for Steiner minimum networks in uniform orientation metrics

✍ M. Brazil; D. A. Thomas; J. F. Weng 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 260 KB

## Abstract The Steiner problem in the λ‐plane is the problem of constructing a minimum network connecting a given set of nodes (called terminals), with the constraint that all line segments have slopes chosen from the λ uniform orientation angles ω, 2ω, … , λω, where ω = π/λ. This problem appears

Reducing the Steiner problem in four uni

Reducing the Steiner problem in four uniform orientations

✍ Guo-Hui Lin; Guoliang Xue 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 315 KB 👁 2 views

Uniform Generation of Binary Trees in Pa

Uniform Generation of Binary Trees in Parallel

✍ M.D. Atkinson; J.R. Sack 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 245 KB

An unbiased random generator for binary trees is developed for a CREW-PRAM. The generator is capable of generating a binary tree on \(n\) nodes in time \(O(\log n)\), space \(O(n)\), with \(O(n)\) processors; it is also capable of generating various related combinatorial objects. O 1994 Academic Pre

Exact location of the Steiner point of t

Exact location of the Steiner point of the three-point Steiner minimum tree in λ-geometry

✍ Michiyoshi Hayase 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

On the joint distribution of the nodes i

On the joint distribution of the nodes in uniform multidimensional binary trees

✍ Rainer Kemp 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 313 KB 👁 2 views

Multidimensional binary trees represent a symbiosis of trees and tries, and they essentially arise in the construction of search trees for multidimensional keys. The set of nodes in a d-dimensional binary tree can be partitioned into layers according to the nodes appearing in the ith dimension. We d