✦ LIBER ✦

On Steiner Minimal Trees with Rectilinear Distance

✍ Scribed by Hwang, F. K.

Book ID: 118195702
Publisher: Society for Industrial and Applied Mathematics
Year: 1976
Tongue: English
Weight: 928 KB
Volume: 30
Category: Article
ISSN: 0036-1399
DOI: 10.1137/0130013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Steiner Minimal Trees in Rectilinear and

Steiner Minimal Trees in Rectilinear and Octilinear Planes

✍ Song Pu Shang; Tong Jing 📂 Article 📅 2007 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 299 KB

Two probabilistic results on rectilinear

Two probabilistic results on rectilinear steiner trees

✍ Marshall W. Bern 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 812 KB

On Steiner minimal trees withLpdistance

✍ Zi -Cheng Liu; Ding -Zhu Du 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 453 KB

A simple proof of Hwang's theorem for re

A simple proof of Hwang's theorem for rectilinear Steiner minimal trees

✍ D. S. Richards; J. S. Salowe 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 452 KB

A Distributed Heuristic Algorithm for th

A Distributed Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem

✍ Cinel, S.; Bazlamacci, C.F. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 188 KB

Steiner minimal trees on regular polygon

Steiner minimal trees on regular polygons with centre

✍ J.F. Weng; R.S. Booth 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 594 KB

Let P,,n~>3, be the set of vertices of a regular n-gon and o be the centre of P,. Let P+ = P, u [o}. In this paper we determine the Steiner minimal trees on P+. By this example we will see how complicated the Steiner problem may become if even one regular point not lying on the Steiner polygon is ad