✦ LIBER ✦

A practical algorithm for the minimum rectilinear steiner tree

✍ Scribed by Jun Ma; Bo Yang; Shaohan Ma

Publisher: Springer
Year: 2000
Tongue: English
Weight: 288 KB
Volume: 15
Category: Article
ISSN: 1000-9000
DOI: 10.1007/bf02951931

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast heuristic algorithms for rectilinea

Fast heuristic algorithms for rectilinear steiner trees

✍ Dana Richards 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 936 KB

Rectilinear steiner tree heuristics and

Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

✍ Y. C. Wee; S. Chaiken; S. S. Ravi 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 899 KB

Delay-related secondary objectives for r

✍ Sven Peyer; Martin Zachariasen; David Grove Jørgensen 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 759 KB

The rectilinear Steiner tree problem in the plane is to construct a minimum-length tree interconnecting a set of points (called terminals) consisting of horizontal and vertical line segments only. Rectilinear Steiner minimum trees (RSMTs) can today be computed quickly for realistic instances occurri

Faster Approximation Algorithms for the

Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem

✍ U. Fößmeier; M. Kaufmann; A. Zelikovsky 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 217 KB

Reductions for the rectilinear steiner t

Reductions for the rectilinear steiner tree problem

✍ Pawel Winter 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 842 KB

A Prim-based Heuristic Algorithm for Obs

A Prim-based Heuristic Algorithm for Obstacle Avoiding Rectilinear Steiner Minimal Tree

✍ M.M.Ibrahim Mohamed; B. Tawfik 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 13 KB