𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast heuristic algorithms for rectilinear steiner trees

✍ Scribed by Dana Richards

Publisher
Springer
Year
1989
Tongue
English
Weight
936 KB
Volume
4
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Rectilinear steiner trees: Efficient spe
Rectilinear steiner trees: Efficient special-case algorithms
✍ A. V. Aho; M. R. Garey; F. K. Hwang πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 886 KB

## Abstract A minimal rectilinear Steiner tree for a set A of points in the plane is a tree which interconnects A using horizontal and vertical lines of shortest possible total length. Such trees have potential application to wire layout for printed circuits. Unfortunately, at present no practical

A fast algorithm for Steiner trees
A fast algorithm for Steiner trees
✍ L. Kou; G. Markowsky; L. Berman πŸ“‚ Article πŸ“… 1981 πŸ› Springer-Verlag 🌐 English βš– 248 KB

Given an undirected distance graph G = (V, E, d) and a set S, where V is the set of vertices in G, E is the set of edges in G, d is a distance function which maps E into the set of nonnegative numbers and S___ V is a subset of the vertices of V, the Steiner tree problem is to find a tree of G that s