𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Faster algorithm for optimum Steiner trees

✍ Scribed by Jens Vygen

Book ID
113663243
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
228 KB
Volume
111
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Faster exact algorithms for steiner tree
Faster exact algorithms for steiner trees in planar networks
✍ Marshall Bern πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 739 KB

We improve the time and space complexities of dynamic programming algorithms that compute optimal Steiner trees spanning nodes in planar networks. Our algorithms have special application to the rectilinear Steiner problem.

Algorithms for terminal Steiner trees
Algorithms for terminal Steiner trees
✍ FΓ‘bio Viduani Martinez; JosΓ© Coelho de Pina; JosΓ© Soares πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 499 KB
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