✦ LIBER ✦

Interconnecting networks in the plane: The steiner case

✍ Scribed by Dan Trietsch

Publisher: John Wiley and Sons
Year: 1990
Tongue: English
Weight: 752 KB
Volume: 20
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230200109

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Worst-case ratios of networks in the rec

Worst-case ratios of networks in the rectilinear plane

✍ Ulrich Brenner; Jens Vygen 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB

## Abstract For point sets in the rectilinear plane, we consider the following five measures of the interconnect length and prove bounds on the worst‐case ratio: minimum Steiner tree, minimum star, clique, minimum spanning tree, and bounding box. In particular, we prove that, for any set of __n__ p

The local Steiner problem in normed plan

The local Steiner problem in normed planes

✍ Konrad J. Swanepoel 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB 👁 2 views

Thek-Steiner Ratio in the Rectilinear Pl

Thek-Steiner Ratio in the Rectilinear Plane

✍ Al Borchers; Ding-Zhu Du; Biao Gao; Pengjun Wan 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 240 KB

A Steiner minimum tree SMT in the rectilinear plane is the shortest length tree interconnecting a set of points, called the regular points, possibly using Ž . additional vertices. A k-size Steiner minimum tree kSMT is one that can be split into components where all regular points are leaves and all

The Hyperstar Interconnection Network

✍ Abdel-Elah Al-Ayyoub; Khaled Day 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 661 KB

Locating information with uncertainty in

Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory

✍ Lefteris M. Kirousis; Evangelos Kranakis; Danny Krizanc; Yannis C. Stamatiou 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

The Steiner ratio for the dual normed pl

The Steiner ratio for the dual normed plane

✍ Peng-Jun Wan; Ding-Zhu Du; Ronald L. Graham 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 592 KB

A minimum Steiner tree for a given set X of points is a network interconnecting the points of X having minimal possible total length. The Steiner ratio for a metric space is the largest lower bound for the ratio of lengths between a minimum Steiner tree and a minimum spanning tree on the same set of